Maximum flow is approximable by deterministic constant-time algorithm in sparse networks

Details Maximum flow is approximable by deterministic constant-time algorithm in sparse networks Maximum flow is approximable by deterministic constant-time algorithm in sparse networks

2010-05-04

arxiv.org/abs/1005.0513v1

Computer Science

Data Structures and Algorithms

8 pages

Scientific paper

We show a deterministic constant-time parallel algorithm for finding an
almost maximum flow in multisource-multitarget networks with bounded degrees
and bounded edge capacities. As a consequence, we show that the value of the
maximum flow over the number of nodes is a testable parameter on these
networks.

Affiliated with

Also associated with

No associations

Rating

Maximum flow is approximable by deterministic constant-time algorithm in sparse networks 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 Maximum flow is approximable by deterministic constant-time algorithm in sparse networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum flow is approximable by deterministic constant-time algorithm in sparse networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532194