Parameterized Algorithms for Graph Partitioning Problems

Parameterized Algorithms for Graph Partitioning Problems We study a broad class of graph partitioning problems. Each problem is defined by two constants, α 1 and α 2. The input is a graph G, an integer k and a number p, and the objective is to find a subset U ⊆ V $U\subseteq V$ of size k, such that α 1 m 1 + α 2 m 2 is at most (or at least) p, where m 1, m 2 are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in U, respectively. This class of fixed-cardinality graph partitioning problems (FGPPs) encompasses Max (k, n − k)-Cut, Min k-Vertex Cover, k-Densest Subgraph, and k-Sparsest Subgraph. Our main result is a 4 k + o(k)Δ k ⋅n O(1) time algorithm for any problem in this class, where Δ ≥ 1 is the maximum degree in the input graph. This resolves an open question posed by Bonnet et al. (Proc. International Symposium on Parameterized and Exact Computation, 2013). We obtain faster algorithms for certain subclasses of FGPPs, parameterized by p, or by (k + p). In particular, we give a 4 p + o(p)⋅n O(1) time algorithm for Max (k, n − k)-Cut, thus improving significantly the best known p p ⋅n O(1) time algorithm by Bonnet et al. Theory of Computing Systems Springer Journals

Parameterized Algorithms for Graph Partitioning Problems

Loading next page...
Springer US
Copyright © 2016 by Springer Science+Business Media New York
Computer Science; Theory of Computation
Publisher site
See Article on Publisher Site


You’re reading a free preview. Subscribe to read the entire article.

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial