Skip to Main content Skip to Navigation
Journal articles

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

Vicente Acuña 1, 2 Etienne Birmelé 1, 3 Ludovic Cottret 4 Pierluigi Crescenzi 5 Fabien Jourdan 6 Vincent Lacroix 1 Alberto Marchetti-Spaccamela 7 Andrea Marino 5 Paulo Vieira Milreu 1 Marie-France Sagot 1 Leen Stougie 8, 9 
1 BAMBOO - An algorithmic view on genomes, cells, and environments
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
2 Mathomics
3 SG - Laboratoire Statistique et Génome
4 LISBP - Laboratoire d'Ingénierie des Systèmes Biologiques et des Procédés
5 DSI - Dipartimento di Sistemi e Informatica
6 ToxAlim-MeX - Métabolisme et Xénobiotiques
ToxAlim - ToxAlim
7 DIS - Dipartimento di Informatica e Sistemistica "Antonio Ruberti"
8 CWI - Centrum voor Wiskunde en Informatica
9 VU - Vrije Universiteit Amsterdam [Amsterdam]
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.
Keywords : Feedback arc set Maximal DAG Story arc set
Document type :
Journal articles
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
https://hal.inria.fr/hal-00764025
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Wednesday, December 12, 2012 - 11:05:57 AM
Last modification on : Saturday, August 6, 2022 - 3:46:25 AM
Long-term archiving on: : Sunday, December 18, 2016 - 12:12:48 AM

File

Vignette du document
stories.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | UNIV-LYON1 | UNIV-EVRY | INSA-TOULOUSE | INRA | IRISA | INSMI | BAMBOO | INRIA-CHILE | BIOENVIS | INRIA2 | TDS-MACS | UR1-MATH-STIC | UR1-UFR-ISTIC | INSA-GROUPE | UDL | TBI | INRAE | ANR | UR1-MATH-NUM | TOXALIM | TOXALIM-MEX | UNIV-UT3 | UT3-TOULOUSEINP

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

556

Files downloads

320

 

Contact                    Legal Notice                    Personal Data