The Algorithmic Complexity of k-Domatic Partition of Graphs

DOI10.1007/978-3-642-33475-7_17zbMath1362.68109OpenAlexW129224790MaRDI QIDQ2915174

Hongyu Liang

Publication date: 21 September 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-33475-7_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs