Afficher la couverture 'Telling Stories | Acuña, Vicente' en grand format
/5

0 avis

Telling Stories

Archive ouverte

Acuña, Vicente | Birmele, Etienne | Cottret, Ludovic | Crescenzi, Pierluigi | Jourdan, Fabien | Lacroix, Vincent | Marchetti-Spaccamela, Alberto | Marino, Andrea | Vieira Milreu, Paulo | Sagot, Marie-France | Stougie, Leen

Edité par CCSD -

International audience. 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.

Consulter en ligne

Suggestions

Du même auteur

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure

Archive ouverte | Milreu, Paulo Vieira | CCSD

International audience. MOTIVATION: The increasing availability of metabolomics data enables to better understand the metabolic processes involved in the immediate response of an organism to environmental changes an...

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

Archive ouverte | Acuña, Vicente | CCSD

International audience. 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 ...

Telling Stories Fast

Archive ouverte | Borassi, Michele | CCSD

International audience. This paper presents a linear-time delay algorithm for enumerating all directed acyclic subgraphs of a directed graph G(V,E) that have their sources and targets included in two subsets S and T...

Chargement des enrichissements...