Algorithms and Computation
From MaRDI portal
Publication:5191672
DOI10.1007/b94771zbMath1205.68255OpenAlexW1769833081MaRDI QIDQ5191672
Daniel Vanderpooten, Zsolt Tuza, Cristina Bazgan
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94771
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)
Related Items (15)
The balanced satisfactory partition problem ⋮ Degree-constrained decompositions of graphs: Bounded treewidth and planarity ⋮ Efficient algorithms for decomposing graphs under degree constraints ⋮ Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs ⋮ Min-max communities in graphs: complexity and computational properties ⋮ Improper C-colorings of graphs ⋮ Satisfactory graph partition, variants, and generalizations ⋮ The satisfactory partition problem ⋮ Aspects of upper defensive alliances ⋮ Complexity and kernels for bipartition into degree-bounded induced graphs ⋮ Parameterized complexity of satisfactory partition problem ⋮ Asymptotically almost every \(2r\)-regular graph has an internal partition ⋮ Stabilization Time in Weighted Minority Processes ⋮ A note on the satisfactory partition problem: constant size requirement ⋮ (Dis)assortative partitions on random regular graphs
This page was built for publication: Algorithms and Computation
