All maximal independent sets and dynamic dominance for sparse graphs

David Eppstein. All maximal independent sets and dynamic dominance for sparse graphs. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005. pages 451-459, SIAM, 2005. [doi]

Abstract

Abstract is missing.