✦ LIBER ✦

A note upon minimal path problem

✍ Scribed by Jaroslav Morávek

Publisher: Elsevier Science
Year: 1970
Tongue: English
Weight: 675 KB
Volume: 30
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90154-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the constrained shortest-path

A note on the constrained shortest-path problem

✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

A note on k-shortest paths problem

✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

A Note on Minimal Displacement and Retra

A Note on Minimal Displacement and Retraction Problems

✍ Krzysztof Bolibok; Kazimierz Goebel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 99 KB

A note on shortest path, assignment, and

A note on shortest path, assignment, and transportation problems

✍ A. J. Hoffman; H. M. Markowitz 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

A note on the problem of updating shorte

A note on the problem of updating shortest paths

✍ Satoru Fujishige 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

A shortest augmenting path method for so

A shortest augmenting path method for solving minimal perfect matching problems

✍ Ulrich Derigs 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 551 KB

## Abstract An efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique. The a