✦ LIBER ✦

A fast algorithm for maximum integral two-commodity flow in planar graphs

✍ Scribed by Ephraim Korach; Michal Penn

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 496 KB
Volume: 47
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90153-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extended planar algorithm for maximum

An extended planar algorithm for maximum integral two-flow

✍ Manor, Raanan; Penn, Michal 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB 👁 2 views

Several problems, including the maximum integral two-flow problem, are known to be NPcomplete, but efficiently solvable for planar graphs. In this paper, we extend the algorithm for maximum integral two-flow in planar graphs to certain undirected K 3,3 -free graphs (graphs not containing any subgrap

A fast algorithm for minimum weight odd

A fast algorithm for minimum weight odd circuits and cuts in planar graphs

✍ Adam N. Letchford; Nicholas A. Pearson 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 157 KB

A new—old algorithm for minimum-cut and

A new—old algorithm for minimum-cut and maximum-flow in closure graphs

✍ Dorit S. Hochbaum 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB