Article

Balanced graph partitioning

Authors:

Konstantin Andreev and

Harald RäckeAuthors Info & Claims

SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

June 2004

Pages 120 - 124

https://doi.org/10.1145/1007912.1007931

Published: 27 June 2004 Publication History

Get Access

Abstract

In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • n<over>k) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is the (2,1)-balanced partitioning problem. We present a bicriteria polynomial time approximation algorithm with an O(log²n)-approximation for any constant υ > 1. For υ = 1 we show that no polytime approximation algorithm can guarantee a finite approximation ratio unless P=NP. Previous work has only considered the (k, υ)-balanced partitioning problem for υ ≥ 2.

References

[1]

Sanjeev Arora, David Karger, and Marek Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In 27th Annual ACM Symposium on the Theory of Computing, pages 284--293, 1995.

Digital Library

Google Scholar

[2]

Even, Naor, Rao, and Schieber. Fast approximate graph partitioning algorithms. SIAM Journal of Computing, 28(6):2187--2214, 1999.

Digital Library

Google Scholar

[3]

Guy Even, Joseph Naor, Satish Rao, and Baruch Schieber. Divide-and-conquer approximation algorithms using spreading metrics. Journal of the ACM(JACM), 47(4):585--616, 2000.

Digital Library

Google Scholar

[4]

U. Feige, R. Krauthgamer, and K. Nissim. Approximating the minimum bisection size. In 32nd Annual ACM Symposium on the Theory of Computing, pages 530--536, 2000.

Digital Library

Google Scholar

[5]

Uriel Feige and Robert Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM Journal on Computing, 31(4):1090--1118, 2002.

Digital Library

Google Scholar

[6]

C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. In 19th IEEE Design Automation Conference, pages 175--181, 1982.

Digital Library

Google Scholar

[7]

M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Co, San Francisco, CA, 1979.

Digital Library

Google Scholar

[8]

D. Hochbaum and D. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing, 17(3):539--551, 1988.

Digital Library

Google Scholar

[9]

B.W. Kernighan and S. Lin. An efficient heuristic for partitioning graphs. Bell Sys. Tech. Journal, 49:291--308, 1970.

Google Scholar

[10]

T. Leighton, F. Makedon, and S. Tragoudas. Approximation algorithms for vlsi partition problems. In IEEE International Symposium on Circuits and Systems, (ISCAS '90), volume 4, pages 2865--2868, 1990.

Crossref

Google Scholar

[11]

T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM(JACM), 46(6):787--832, 1999.

Digital Library

Google Scholar

[12]

Huzur Saran and Vijay V. Vazirani. Finding k-cuts within twice the optimal. SIAM Journal of Computing, 24(1):101--108, 1995.

Digital Library

Google Scholar

[13]

Horst D. Simon and Shang-Hua Teng. How good is recursive bisection? SIAM Journal on Scientific Computing, 18(5):1436--1445, 1997.

Digital Library

Google Scholar

Cited By

View all

Li JKang Y(2024)GraphSER: Distance-Aware Stream-Based Edge Repartition for Many-Core SystemsACM Transactions on Architecture and Code Optimization10.1145/3661998Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3661998
Yang BZheng WLian XCai YWang X(2024)HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over GraphsProceedings of the ACM on Management of Data10.1145/36392842:1(1-25)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639284
Wang MXu WYi XWu SPeng ZKe XGao YXu XGuo RXie C(2024)Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data SegmentProceedings of the ACM on Management of Data10.1145/36392692:1(1-27)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639269
Show More Cited By

Index Terms

Balanced graph partitioning
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Recommendations

Fast Approximate Graph Partitioning Algorithms

We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem called minimum capacity $\rho$-separators. A $\rho$-separator is a subset of ...
Read More
Partitioning a graph into small pieces with applications to path transversal

Given a graph $$G = (V, E)$$G=(V,E) and an integer $$k \in \mathbb {N}$$kýN, we study $$k$$k-Vertex Separator (resp. $$k$$k-Edge Separator), where the goal is to remove the minimum number of vertices (resp. edges) such that each connected component in ...
Read More
Partitioning of a graph into induced subgraphs not containing prescribed cliques
Abstract
Let K p be a complete graph of order p ≥ 2. A K p-free k-coloring of a graph H is a partition of V ( H ) into V 1 , V 2 … , V k such that H [ V i ] does not contain K p for each i ≤ k. In 1977 Borodin and Kostochka conjectured that any graph H ...
Read More

Comments

Information & Contributors

Information

Published In

SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

June 2004

332 pages

ISBN:1581138407

DOI:10.1145/1007912

General Chair:
Phil Gibbons
Intel Research
,
Program Chair:
Micah Adler
University of Massachusetts

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA04

Sponsor:

SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004

June 27 - 30, 2004

Barcelona, Spain

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

135
Total Citations
View Citations
2,368
Total Downloads

Downloads (Last 12 months)221
Downloads (Last 6 weeks)18

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li JKang Y(2024)GraphSER: Distance-Aware Stream-Based Edge Repartition for Many-Core SystemsACM Transactions on Architecture and Code Optimization10.1145/3661998Online publication date: 26-Apr-2024
https://dl.acm.org/doi/10.1145/3661998
Yang BZheng WLian XCai YWang X(2024)HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over GraphsProceedings of the ACM on Management of Data10.1145/36392842:1(1-25)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639284
Wang MXu WYi XWu SPeng ZKe XGao YXu XGuo RXie C(2024)Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data SegmentProceedings of the ACM on Management of Data10.1145/36392692:1(1-27)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639269
Guo QGuo HLu YGuo TZhang JZhang JLuo HHuang LZhao Y(2024)Optimizing Task Orchestration for Distributed Real-Time Electromagnetic Transient SimulationIEEE Access10.1109/ACCESS.2024.340407012(74818-74830)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3404070
Cai QGuo XHuang S(2024)A self-supervised learning model for graph clustering optimization problemsKnowledge-Based Systems10.1016/j.knosys.2024.111549290:COnline publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1016/j.knosys.2024.111549
Sheng SZhang ZZhou PWu X(2024)An effective algorithm for genealogical graph partitioningApplied Intelligence10.1007/s10489-023-05265-154:2(1798-1817)Online publication date: 22-Jan-2024
https://doi.org/10.1007/s10489-023-05265-1
Zhou YSong YLeng JLiu ZCui WZhang ZGuo CChen QLi LGuo MBartolini ARietveld KSchuman CMoreira J(2023)AdaptGearProceedings of the 20th ACM International Conference on Computing Frontiers10.1145/3587135.3592199(52-62)Online publication date: 9-May-2023
https://dl.acm.org/doi/10.1145/3587135.3592199
Chen LFang JYu ZTong YCao SWang LSingh ASun YAkoglu LGunopulos DYan XKumar ROzcan FYe J(2023)A Data-driven Region Generation Framework for Spatiotemporal Transportation Service ManagementProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599760(3842-3854)Online publication date: 6-Aug-2023
https://dl.acm.org/doi/10.1145/3580305.3599760
Cheng MZhang JLong S(2023)GMaglev: Graph-friendly Consistent Hashing for Distributed Social Graph Partition2023 2nd International Conference on Innovations and Development of Information Technologies and Robotics (IDITR)10.1109/IDITR57726.2023.10145968(30-38)Online publication date: May-2023
https://doi.org/10.1109/IDITR57726.2023.10145968
Venkataraman YAngelina JSubhashini SVadlamudi VP N(2023)Graph Theoretic Approach to IOT Applications2023 International Conference on Computer Communication and Informatics (ICCCI)10.1109/ICCCI56745.2023.10128193(1-4)Online publication date: 23-Jan-2023
https://doi.org/10.1109/ICCCI56745.2023.10128193
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Fast Approximate Graph Partitioning Algorithms

Partitioning a graph into small pieces with applications to path transversal

Partitioning of a graph into induced subgraphs not containing prescribed cliques