Computing and Combinatorics
From MaRDI portal
Publication:5717006
DOI10.1007/11533719zbMath1128.68396OpenAlexW4376561447MaRDI QIDQ5717006
Daniel Vanderpooten, Zsolt Tuza, Cristina Bazgan
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (7)
The balanced satisfactory partition problem ⋮ Degree-constrained decompositions of graphs: Bounded treewidth and planarity ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Parameterized complexity of satisfactory partition problem ⋮ Asymptotically almost every \(2r\)-regular graph has an internal partition ⋮ Stabilization Time in Weighted Minority Processes ⋮ On the complexity of some quorum colorings problems of graphs
This page was built for publication: Computing and Combinatorics
