Parameterized algorithms for graph partitioning problems

DOI10.1007/s00224-016-9706-0zbMath1378.68094arXiv1403.0099MaRDI QIDQ2408556

Meirav Zehavi, Hadas Shachnai

Publication date: 12 October 2017

Published in: Theory of Computing Systems, Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.0099

zbMATH Keywords

graph partitioning; parameterized algorithm; representative family; random separation

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)