Searching for "Splitting an Expander Graph." – sorted by Relevance.
-
Splitting an Expander Graph
- Splitting an expander graph Alan M. Frieze Michael Molloy y Abstract Let G = (V; E) be an r
- Cited by 3 (0 self) – Add To MetaCart
-
A (1 + ffl)-Approximation Algorithm for Partitioning Hypergraphs Using a New Algorithmic Version of the Lov'asz Local Lemma\Lambda
- is in splitting expander graphs [7]. Frieze and Molloy [7] use an asymmetric version of the LLL to prove
- Add To MetaCart
-
A (1 + epsilon)-Approximation Algorithm for Partitioning Hypergraphs Using a New Algorithmic Version of the Lovász Local Lemma
- splittings for expander graphs. The result of [5] is not general enough to replace the non
- Add To MetaCart

