Covering Pairs in Directed Acyclic Graphs

DOI10.1007/978-3-319-04921-2_10zbMath1407.68203arXiv1310.5037OpenAlexW2126924325MaRDI QIDQ5404906

Stefano Beretta, Niko Beerenwinkel, Yuri Pirola, Riccardo Dondi, Paola Bonizzoni

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5037

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

An external-memory algorithm for string graph construction ⋮ Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks

This page was built for publication: Covering Pairs in Directed Acyclic Graphs