Parameterized complexity of DAG partitioning

DOI10.1007/978-3-642-38233-8_5MaRDI QIDQ4924637zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Fixed-parameter algorithms for DAG partitioning
• On a DAG partitioning problem
• On the parameterized complexity of 2-partitions
• The parameterized complexity landscape of finding 2-partitions of digraphs
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization

Cited in

(5)

• A linear-time parameterized algorithm for computing the width of a DAG
• On a DAG partitioning problem
• Acyclic digraphs
• Fixed-parameter algorithms for DAG partitioning
• The complexity of node blocking for dags

This page was built for publication: Parameterized complexity of DAG partitioning

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