Cut-Matching Games on Directed Graphs

Details Cut-Matching Games on Directed Graphs Cut-Matching Games on Directed Graphs

2010-10-06

arxiv.org/abs/1010.1047v1

Computer Science

Data Structures and Algorithms

Scientific paper

We give O(log^2 n)-approximation algorithm based on the cut-matching
framework of [10, 13, 14] for computing the sparsest cut on directed graphs.
Our algorithm uses only O(log^2 n) single commodity max-flow computations and
thus breaks the multicommodity-flow barrier for computing the sparsest cut on
directed graphs

Affiliated with

Also associated with

No associations

Rating

Cut-Matching Games on Directed Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cut-Matching Games on Directed Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cut-Matching Games on Directed Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427101