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

DOI10.1016/j.tcs.2012.07.023zbMath1251.05079OpenAlexW2114114129WikidataQ57265619 ScholiaQ57265619MaRDI QIDQ714835

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

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.023

zbMATH Keywords

feedback arc setmaximal DAGmaximal directed acyclic graphsstory arc set

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items

Maximal Acyclic Subgraphs and Closest Stable Matrices

Uses Software

• MetExplore

Cites Work

• Computational aspects of monotone dualization: a brief survey
• On enumerating all minimal solutions of feedback problems