𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Bing Su; Qingchuan Xu; Peng Xiao

Book ID
106407179
Publisher
Springer US
Year
2007
Tongue
English
Weight
277 KB
Volume
16
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the complexity of finding paths in a
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
✍ Arthur W. Chou; Ker-I Ko πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do