Listing Maximal Independent Sets with Minimal Space and Bounded Delay - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Listing Maximal Independent Sets with Minimal Space and Bounded Delay

(1) , (1, 2) , (1, 2) , (3) , (1)
1
2
3

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.
Fichier principal
Vignette du fichier
conte_etal_2017.pdf (742.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01609012 , version 1 (03-10-2017)

Identifiers

Cite

Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca P 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⟩

Collections

INRIA INRIA2
84 View
433 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More