Communications of the ACM

Home/Magazine Archive/October 2008 (Vol. 51, No. 10)/Geometry, Flows, and Graph-Partitioning Algorithms/Abstract

Research highlights

Geometry, Flows, and Graph-Partitioning Algorithms

By Sanjeev Arora, Satish Rao, Umesh Vazirani
Communications of the ACM, October 2008, Vol. 51 No. 10, Pages 96-105
10.1145/1400181.1400204
Comments

View as: Print Mobile App ACM Digital Library In the Digital Edition Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook

Graph partitioning illustration — Figure 1: A graph and a partition into two subsets S, S _ . In this case, the two subsets have equal number of vertices; such a partition is called a bisection. The number of edges crossing the cut is 7. If the number of vertices on the two sides is

"Graph partitioning" refers to a family of computational problems in which the vertices of a graph have to be partitioned into two (or more) large pieces while minimizing the number of the edges that cross the cut. The goal of this paper is to survey an interesting combination of techniques that have recently led to progress on graph partioning problems.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.