A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition

DOI10.1007/978-3-642-22685-4_30zbMath1353.68291OpenAlexW119700597MaRDI QIDQ3087961

Binh-Minh Bui-Xuan, Andrzej Proskurowski, Daniel Meister, Pinar Heggernes

Publication date: 17 August 2011

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-22685-4_30

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Tree-representation of set families and applications to combinatorial decompositions

This page was built for publication: A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition