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

  • Authors:

  • Vicente Acuñ/a;Etienne Birmelé/;Ludovic Cottret;Pierluigi Crescenzi;Fabien Jourdan;Vincent Lacroix;Alberto Marchetti-Spaccamela;Andrea Marino;Paulo Vieira Milreu;Marie-France Sagot;Leen Stougie

  • Affiliations:

  • Université/ de Lyon, F-69000 Lyon/ Université/ Lyon 1/ CNRS, UMR5558, Laboratoire de Biomé/trie et Biologie Evolutive, F-69622 Villeurbanne, France and INRIA Rhô/ne-Alpes, 38330. M ...;Université/ de Lyon, F-69000 Lyon/ Université/ Lyon 1/ CNRS, UMR5558, Laboratoire de Biomé/trie et Biologie Evolutive, F-69622 Villeurbanne, France and INRIA Rhô/ne-Alpes, 38330. M ...;Laboratoire dIngé/nierie des Systè/mes Biologiques et des Procé/dé/s (LISBP), UMR CNRS 5504 - INRA 792, Toulouse, France;Università/ di Firenze, Dipartimento di Sistemi e Informatica, I-50134 Firenze, Italy;INRA UMR1331Toxalim, Toulouse, France;Université/ de Lyon, F-69000 Lyon/ Université/ Lyon 1/ CNRS, UMR5558, Laboratoire de Biomé/trie et Biologie Evolutive, F-69622 Villeurbanne, France and INRIA Rhô/ne-Alpes, 38330. M ...;Sapienza University of Rome, Italy;Università/ di Firenze, Dipartimento di Sistemi e Informatica, I-50134 Firenze, Italy;Université/ de Lyon, F-69000 Lyon/ Université/ Lyon 1/ CNRS, UMR5558, Laboratoire de Biomé/trie et Biologie Evolutive, F-69622 Villeurbanne, France;Université/ de Lyon, F-69000 Lyon/ Université/ Lyon 1/ CNRS, UMR5558, Laboratoire de Biomé/trie et Biologie Evolutive, F-69622 Villeurbanne, France and INRIA Rhô/ne-Alpes, 38330. M ...;VU University and CWI, Amsterdam, The Netherlands

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2012

Quantified Score

Hi-index 5.23

Visualization

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.