Quantum Algorithms for Matching and Network Flows

Details Quantum Algorithms for Matching and Network Flows Quantum Algorithms for Matching and Network Flows

2005-08-27

arxiv.org/abs/quant-ph/0508205v2

Physics

Quantum Physics

13 pages, v2: added an Omega(n^2) lower bound for network flows

Scientific paper

We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time O(n^2 (sqrt{m/n} + log n) log n), and finding a maximal flow in an integer network in time O(min(n^{7/6} sqrt m * U^{1/3}, sqrt{n U} m) log n), where n is the number of vertices, m is the number of edges, and U <= n^{1/4} is an upper bound on the capacity of an edge.

Affiliated with

Also associated with

No associations

Rating

Quantum Algorithms for Matching and Network Flows 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 Quantum Algorithms for Matching and Network Flows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithms for Matching and Network Flows will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568180