𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple, efficient algorithm for maximum finding on rings

✍ Scribed by Lisa Higham; Teresa Przytycka

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
560 KB
Volume
58
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
✍ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

Efficient Algorithms for Finding the Max
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
✍ Wun-Tat Chan; Francis Y.L. Chin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ε½ . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ε½ nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and Β¨ertex-disjoint . cases are considered in this paper. Note

A simple linear time algorithm for findi
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
✍ Glenn K. Manacher; Terrance A. Mankus πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 209 KB πŸ‘ 1 views

## Abstract We exhibit an algorithm for finding a maximum independent set (MIS) for __n__ presorted, unweighted circular arcs in time 0(__n__). Unlike previous algorithms, this is achieved by means of trivial postprocessing of the output of a straightforward algorithm for finding an MIS for a set o