How to cut a graph into many pieces

Authors:
Ruben van der Zwaan;André Berger;Alexander Grigoriev
Affiliations:
Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands;Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands;Department of Quantitative Economics, Maastricht University, Maastricht, The Netherlands
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 22
Cited 1

A separator theorem for graphs with an excluded minor and its applications

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Finding $k$ Cuts within Twice the Optimal

SIAM Journal on Computing
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Efficient Planarity Testing

Journal of the ACM (JACM)
An improved approximation algorithm for MULTIWAY CUT

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A note on the bounded fragmentation property and its applications in network reliability

European Journal of Combinatorics
Multiway cuts in node weighted graphs

Journal of Algorithms
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

Journal of Algorithms
Finding small balanced separators

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Parameterized graph separation problems

Theoretical Computer Science - Parameterized and exact computation
Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique

SIAM Journal on Computing
Polynomial algorithm for the k-cut problem

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

Algorithmica
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Simple and Improved Parameterized Algorithms for Multiterminal Cuts

Theory of Computing Systems - Special Issue: Symposium on Computer Science; Guest Editors: Sergei Artemov, Volker Diekert and Alexander Razborov
The Valve Location Problem in Simple Network Topologies

INFORMS Journal on Computing

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of finding a graph separator of a given size that decomposes the graph into the maximum number of connected components. We present the picture of the computational complexity and the approximability of this problem for several natural classes of graphs. We first provide an overview of the hardness of approximation of this problem, which stems mainly from its close relation to the INDEPENDENT SET and to the MAXIMUM CLIQUE problem. Next, we show that the problem is solvable in polynomial time for interval graphs and graphs of bounded treewidth. We also show that MAXINUM COMPONENTS is fixed-parameter tractable on planar graphs with the size of the separator as the parameter. Our main contribution is the derivation of an efficient polynomial-time approximation scheme for the problem on planar graphs.