Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...