✦ LIBER ✦

A O(nm log(U/n)) time maximum flow algorithm

✍ Scribed by Antonio Sedeño-Noda; Carlos González-Martín

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 313 KB
Volume: 47
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(200009)47:6<511::aid-nav4>3.0.co;2-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n-log-log-n) Time Algorithm for Con

An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A randomized algorithm for finding maxim

A randomized algorithm for finding maximum with O((log n)2) polynomial tests

✍ Hing F. Ting; Andrew C. Yao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 410 KB

A probabilistic algorithm for verifying

A probabilistic algorithm for verifying matrix products using O(n2) time and log2n + O(1) random bits

✍ Tracy Kimbrel; Rakesh Kumar Sinha 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 376 KB

Balanced network flows. VIII. A revised

Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

The Maximum Number of Times the Same Dis

The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n)

✍ Peter Braß; János Pach 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 70 KB

Proof. Denote by f (n) the maximum number of times the unit distance can occur among n points in convex position in the plane. Let p 1 , p 2 , ..., p n , in this cyclic order, be the vertices of a convex polygon, for which the maximum is attained. Let G denote the geometric graph obtained by connect

A multigrid accelerated time-accurate in

A multigrid accelerated time-accurate inviscid compressible fluid flow solution algorithm employing mesh movement and local remeshing

✍ K. A. Sørensen; O. Hassan; K. Morgan; N. P. Weatherill 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB