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

Probabilistic analysis of a sequential algorithm for finding independent sets

โœ Scribed by Tsuyoshi Kawaguchi; Hideo Nakano; Yoshiro Nakanishi

Book ID
112075171
Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
484 KB
Volume
65
Category
Article
ISSN
8756-6621

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