Congestion in planar graphs with demands on faces

Details Congestion in planar graphs with demands on faces Congestion in planar graphs with demands on faces

2010-08-21

arxiv.org/abs/1008.3653v1

Computer Science

Discrete Mathematics

Scientific paper

We give an algorithm to route a multicommodity flow in a planar graph $G$
with congestion $O(\log k)$, where $k$ is the maximum number of terminals on
the boundary of a face, when each demand edge lie on a face of $G$. We also
show that our specific method cannot achieve a substantially better congestion.

Affiliated with

Also associated with

No associations

Rating

Congestion in planar graphs with demands on faces 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 Congestion in planar graphs with demands on faces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congestion in planar graphs with demands on faces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189055