All maximal independent sets and dynamic dominance for sparse graphs

@article{Eppstein2009AllMI,
  title={All maximal independent sets and dynamic dominance for sparse graphs},
  author={D. Eppstein},
  journal={ArXiv},
  year={2009},
  volume={cs.DS/0407036}
}
  • D. Eppstein
  • Published 2009
  • Mathematics, Computer Science
  • ArXiv
We describe algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output. For bounded degree graphs, our algorithms take constant time per set generated; for minor-closed graph families, the time is O(n) per set, and for more general sparse graph families we achieve subquadratic time per set. We also describe new data structures for maintaining a dynamic vertex set S in a sparse or minor-closed… Expand
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
Counting the number of independent sets in chordal graphs
Cliques in Odd-Minor-Free Graphs
VColor: A practical vertex-cut based approach for coloring large graphs
New Applications of the Nearest-Neighbor Chain Algorithm
On the complexity of monotone dualization and generating minimal hypergraph transversals
Reactive Proximity Data Structures for Graphs
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs
  • J. Leung
  • Mathematics, Computer Science
  • J. Algorithms
  • 1984
Arboricity and Subgraph Listing Algorithms
Homomorphieeigenschaften und mittlere
  • Kantendichte von Graphen. Math. Ann
  • 1967
Homomorphieeigenschaften und mittlere Kantendichte von Graphen