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.
Listing maximal independent sets with minimal space and bounded delay / Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; Versari, Luca. - STAMPA. - 10508:(2017), pp. 144-160. (Intervento presentato al convegno 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017 tenutosi a ita nel 2017) [10.1007/978-3-319-67428-5_13].
Listing maximal independent sets with minimal space and bounded delay
Grossi, Roberto;Marino, Andrea;
2017
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.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
