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.
Liste complète des métadonnées


https://hal.inria.fr/hal-00764025
Contributor : Marie-France Sagot <>
Submitted on : Wednesday, December 12, 2012 - 11:05:57 AM
Last modification on : Friday, February 10, 2017 - 1:11:45 AM
Document(s) archivé(s) le : Sunday, December 18, 2016 - 12:12:48 AM

File

stories.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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, Elsevier, 2012, 457, pp.1--9. <10.1016/j.tcs.2012.07.023>. <hal-00764025>

Share

Metrics

Record views

403

Document downloads

222