Listing Subgraphs by Cartesian Decomposition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Listing Subgraphs by Cartesian Decomposition

Abstract

We investigate a decomposition technique for listing problems in graphs and set systems. It is based on the Cartesian product of some iterators, which list the solutions of simpler problems. Our ideas applies to several problems, and we illustrate one of them in depth, namely, listing all minimum spanning trees of a weighted graph G. Here iterators over the spanning trees for unweighted graphs can be obtained by a suitable modification of the listing algorithm by [Shioura et al., SICOMP 1997], and the decomposition of G is obtained by suitably partitioning its edges according to their weights. By combining these iterators in a Cartesian product scheme that employs Gray coding, we give the first algorithm which lists all minimum spanning trees of G in constant delay, where the delay is the time elapsed between any two consecutive outputs. Our solution requires polynomial preprocessing time and uses polynomial space.
Fichier principal
Vignette du fichier
LIPIcs-MFCS-2018-84.pdf (513.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01964703 , version 1 (23-12-2018)

Identifiers

Cite

Alessio Conte, Roberto P Grossi, Andrea Marino, Romeo Rizzi, Luca P Versari. Listing Subgraphs by Cartesian Decomposition. MFCS 2018 - International Symposium on Mathematical Foundations of Computer Science, Aug 2018, Liverpool, United Kingdom. pp.1868-8969, ⟨10.4230/LIPIcs.MFCS.2018.84⟩. ⟨hal-01964703⟩

Collections

INRIA INRIA2
44 View
158 Download

Altmetric

Share

Gmail Facebook X LinkedIn More