Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization

DOI10.1007/s00453-014-9920-6zbMath1312.68095MaRDI QIDQ2343085

Vangelis Th. Paschos, Édouard Bonnet, Bruno Escoffier, Emeric Tourniaire

Publication date: 4 May 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/13866

zbMATH Keywords

branching; parameterized complexity; greedy; FPT; local partitioning problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)