Login / Signup

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

Vicente AcuñaEtienne BirmeléLudovic CottretPierluigi CrescenziFabien JourdanVincent LacroixAlberto Marchetti-SpaccamelaAndrea MarinoPaulo Vieira MilreuMarie-France SagotLeen Stougie
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • directed acyclic graph
  • directed graph
  • undirected graph
  • equivalence classes