Telling Stories

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 predefined subset of the nodes. We call such DAGs stories. We first show how to compute one story in polynomial-time, and then describe two different algorithms to ''tell'' all possible stories.
Liste complète des métadonnées

https://hal.inria.fr/hal-00748788
Contributor : Marie-France Sagot <>
Submitted on : Tuesday, November 6, 2012 - 8:37:50 AM
Last modification on : Thursday, March 21, 2019 - 2:51:28 PM

Links full text

Identifiers

Collections

Citation

Vicente Acuña, Etienne Birmele, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, et al.. Telling Stories. ICALP 2011 satellite workshop: Graph Algorithms and Applications (GA), 2011, Zurich, Switzerland. ⟨10.1016/j.tcs.2012.07.023⟩. ⟨hal-00748788⟩

Share

Metrics

Record views

479