Telling Stories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

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.

Dates and versions

hal-00748788 , version 1 (06-11-2012)

Identifiers

Cite

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⟩
264 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More