𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time algorithm for a special case of disjoint set union

✍ Scribed by Harold N. Gabow; Robert Endre Tarjan

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
931 KB
Volume
30
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A linear time algorithm for edge colorin
A linear time algorithm for edge coloring of binomial trees
✍ M. Kubale; K. Piwakowski πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 448 KB

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(