Parameterized Complexity of DAG Partitioning

DOI10.1007/978-3-642-38233-8_5zbMath1382.68127OpenAlexW174434617MaRDI QIDQ4924637

Sepp Hartung, Ondřej Suchý, Falk Hüffner, Robert Bredereck, René van Bevern, André Nichterlein, Morgan Chopin

Publication date: 7 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38233-8_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Fixed-parameter algorithms for DAG partitioning ⋮ Acyclic Digraphs

This page was built for publication: Parameterized Complexity of DAG Partitioning