Listing Maximal Independent Sets with Minimal Space and Bounded Delay

Abstract : An independent set is a set of nodes in a graph such that no two of them are adjacent. It is maximal if there is no node outside the independent set that may join it. Listing maximal independent sets in graphs can be applied, for example, to sample nodes belonging to different communities or clusters in network analysis and document clustering. The problem has a rich history as it is related to maximal cliques, dominance sets, vertex covers and 3-colorings in graphs. We are interested in reducing the delay, which is the worst-case time between any two consecutively output solutions, and the memory footprint, which is the additional working space behind the read-only input graph.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01609012
Contributor : Marie-France Sagot <>
Submitted on : Tuesday, October 3, 2017 - 11:47:36 AM
Last modification on : Tuesday, February 26, 2019 - 10:54:02 AM

File

conte_etal_2017.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari. Listing Maximal Independent Sets with Minimal Space and Bounded Delay. International Symposium on String Processing and Information Retrieval (SPIRE), Sep 2017, Palermo, Italy. pp.144-160, ⟨10.1007/978-3-319-67428-5_13⟩. ⟨hal-01609012⟩

Share

Metrics

Record views

130

Files downloads

118