๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity

โœ Scribed by Oscar Garrido; Pierre Kelsen; Andrzej Lingas

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Analysis of parallel algorithms for find
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
โœ H. Chen; A. M. Frieze ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study

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