Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2012

Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets

Abstract

We present a constrained version of the problem of enumerating all maximal directed acyclic subgraphs (DAG) of a graph G. In this version, we enumerate maximal DAGs whose sources and targets belong to a prede ned subset of the nodes. We call such DAGs stories. We rst show how to compute one story in polynomial-time, and then describe two di erent algorithms to \tell" all possible stories.
Fichier principal
Vignette du fichier
stories.pdf (365.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00764025 , version 1 (12-12-2012)

Identifiers

Cite

Vicente Acuña, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, et al.. Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theoretical Computer Science, 2012, 457, pp.1--9. ⟨10.1016/j.tcs.2012.07.023⟩. ⟨hal-00764025⟩
604 View
372 Download

Altmetric

Share

Gmail Facebook X LinkedIn More