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

DOI10.1016/J.TCS.2012.07.023zbMATH Open1251.05079DBLPjournals/tcs/AcunaBCCJLMMMSS12OpenAlexW2114114129WikidataQ57265619 ScholiaQ57265619MaRDI QIDQ714835FDOQ714835

Vincent Lacroix, Pilu Crescenzi, Paulo Vieira Milreu, Ludovic Cottret, Andrea Marino, Marie-France Sagot, Fabien Jourdan, L. Stougie, Etienne Birmelé, V. 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

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

Cites Work

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

Cited In (1)

• Maximal Acyclic Subgraphs and Closest Stable Matrices

Uses Software

• MetExplore

This page was built for publication: Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714835)