✦ LIBER ✦

Finding the shortest paths by node combination

✍ Scribed by Xin Lu; Martin Camitz

Book ID: 108051994
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 488 KB
Volume: 217
Category: Article
ISSN: 0096-3003
DOI: 10.1016/j.amc.2011.01.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the k Shortest Paths

✍ Eppstein, David 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 416 KB

Finding the most vital node of a shortes

Finding the most vital node of a shortest path

✍ Enrico Nardelli; Guido Proietti; Peter Widmayer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 171 KB

In an undirected, 2-node connected graph G = (V; E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in G. The removal of a node and its incident edges from G may increase the distance from r to s. A most vital node of a giv

Finding the k shortest simple paths

✍ Hershberger, John; Maxel, Matthew; Suri, Subhash 📂 Article 📅 2007 🏛 Association for Computing Machinery 🌐 English ⚖ 340 KB

Path enumeration by finding the constrai

Path enumeration by finding the constrained K-shortest paths

✍ N.J. van der Zijpp; S. Fiorenzo Catalano 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 391 KB

A new algorithm to find the shortest pat

A new algorithm to find the shortest paths between all pairs of nodes

✍ G. Gallo; S. Pallottino 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 834 KB

Finding the anti-block vital edge of a s

Finding the anti-block vital edge of a shortest path between two nodes

✍ Bing Su; Qingchuan Xu; Peng Xiao 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 277 KB