✦ LIBER ✦

A General Algorithm for Finding a Shortest Path between two n-Configurations

✍ Scribed by M.C. Er

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 254 KB
Volume: 42
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(87)90020-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dual simplex algorithm for finding all

A dual simplex algorithm for finding all shortest paths

✍ M. Florian; S. Nguyen; S. Pallottino 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB

A decomposition algorithm for locating a

A decomposition algorithm for locating a shortest path between two nodes in a network

✍ John J. Jarvis; Suleyman Tufekci 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 505 KB

A generalized permanent label setting al

A generalized permanent label setting algorithm for the shortest path between specified nodes

✍ George L Nemhauser 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Decomposition algorithms for finding the

Decomposition algorithms for finding the shortest path between a source node and a sink node of a network

✍ Suleyman Tufekci 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

An Incremental Algorithm for a Generaliz

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

✍ G. Ramalingam; Thomas Reps 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv

An algorithm to find all paths between t

An algorithm to find all paths between two nodes in a graph

✍ M. Migliore; V. Martorana; F. Sciortino 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 341 KB