✦ LIBER ✦

Implementing an efficient minimum capacity cut algorithm

✍ Scribed by Hiroshi Nagamochi; Tadashi Ono; Toshihide Ibaraki

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 900 KB
Volume: 67
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01582226

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for the minimum c

An efficient algorithm for the minimum capacity cut problem

✍ M. Padberg; G. Rinaldi 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 757 KB

Practical Performance of Efficient Minim

Practical Performance of Efficient Minimum Cut Algorithms

✍ M. Jünger; G. Rinaldi; S. Thienel 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 544 KB

An Efficient Implementation of a Scaling

An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm

✍ Andrew V Goldberg 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 338 KB

An Efficient Algorithm for Minimum-Weigh

An Efficient Algorithm for Minimum-Weight Bibranching

✍ J. Keijsper; R. Pendavingh 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti

An efficient heuristic algorithm for min

An efficient heuristic algorithm for minimum matching

✍ P. Grassberger; H. Freund 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 653 KB

An efficient minimum and maximum global

An efficient minimum and maximum global snapshot algorithm

✍ L.-B. Chen 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 102 KB