✦ LIBER ✦

The fuzzy shortest path problem and its most vital arcs

✍ Scribed by Kao-Chêng Lin; Maw-Sheng Chern

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 566 KB
Volume: 58
Category: Article
ISSN: 0165-0114
DOI: 10.1016/0165-0114(93)90508-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The k most vital arcs in the shortest pa

The k most vital arcs in the shortest path problem

✍ K. Malik; A.K. Mittal; S.K. Gupta 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 336 KB

The k most vital arcs in the shortest pa

The k most vital arcs in the shortest path problem

✍ K. Malik; A.K. Mittal; S.K. Gupta 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 28 KB

The single most vital arc in the most ec

The single most vital arc in the most economical path problem—A parametric analysis

✍ Lin Kao-Chêng; Chern Maw-Sheng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 582 KB

NC algorithms for the single most vital

NC algorithms for the single most vital edge problem with respect to shortest paths

✍ Sven Venema; Hong Shen; Francis Suraweera 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB

For a weighted, undirected graph G = (YE), the single most vital edge in a network with respect to shortest paths is the edge that, when removed, results in the greatest increase in the shortest distance between two nodes s and t. We give a sequential algorithm for the Single Most Vital Edge problem

Solving the all-pair shortest path query

Solving the all-pair shortest path query problem on interval and circular-arc graphs

✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently