On a DAG Partitioning Problem

DOI10.1007/978-3-642-30541-2_2zbMath1342.05109OpenAlexW78658037MaRDI QIDQ2900581

Abbas Mehrabian, Soroush Alamdari

Publication date: 23 July 2012

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-30541-2_2

zbMATH Keywords

reductionfixed parameter tractabilitypathwidthinapproximability3-SATDAG partitioning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Signed and weighted graphs (05C22)

Related Items (2)

Fixed-parameter algorithms for DAG partitioning ⋮ Acyclic Digraphs

This page was built for publication: On a DAG Partitioning Problem