Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
type: Item
instance of: scholarly article
title: Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
zbMATH Open document ID: 1251.05079
author: V. Acuña
author: Etienne Birmelé
author: Ludovic Cottret
author: Pilu Crescenzi
author: Fabien Jourdan
author: Vincent Lacroix
author: Alberto Marchetti-Spaccamela
author: Andrea Marino
author: Paulo Vieira Milreu
author: Marie-France Sagot
author: L. Stougie
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 6093047
zbMATH Keywords: maximal directed acyclic graphs
zbMATH Keywords: maximal DAG
zbMATH Keywords: feedback arc set
zbMATH Keywords: story arc set
describes a project that uses: MetExplore
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.07.023
OpenAlex ID: W2114114129
Wikidata QID: Q57265619
cites work: Computational aspects of monotone dualization: a brief survey
cites work: On enumerating all minimal solutions of feedback problems
DBLP publication ID: journals/tcs/AcunaBCCJLMMMSS12
DOI: 10.1016/J.TCS.2012.07.023
description: scientific article; zbMATH DE number 6093047