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

A method for finding the maximal set in excess demand

โœ Scribed by Andersson, T.; Erlanson, A.; Gudmundsson, J.; Habis, H.; Ingebretsen Carlson, J.; Kratz, J.

Book ID
127297519
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
363 KB
Volume
125
Category
Article
ISSN
0165-1765

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