What Makes Equitable Connected Partition Easy

DOI10.1007/978-3-642-11269-0_10zbMath1273.68164OpenAlexW1556562107WikidataQ57359848 ScholiaQ57359848MaRDI QIDQ3656856

Frances A. Rosamond, Michael R. Fellows, Jiong Guo, Rosa I. Enciso, Ondřej Suchý, Iyad A. Kanj

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (16)

Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics ⋮ Parameterized complexity of fair deletion problems ⋮ On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Grouped domination parameterized by vertex cover, twin cover, and beyond ⋮ Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization ⋮ Unnamed Item ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds ⋮ Extended MSO model checking via small vertex integrity ⋮ Unnamed Item ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ Finding vertex-surjective graph homomorphisms ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ The parameterised complexity of computing the maximum modularity of a graph

This page was built for publication: What Makes Equitable Connected Partition Easy