Finding an anti-risk path between two nodes in undirected graphs

Peng Xiao (), Yinfeng Xu () and Bing Su ()
Additional contact information
Peng Xiao: Xi’an Jiaotong University
Yinfeng Xu: State Key Lab for Manufacturing Systems Engineering
Bing Su: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2009, vol. 17, issue 3, No 1, 235-246

Abstract: Abstract Given a weighted graph G=(V,E) with a source s and a destination t, a traveler has to go from s to t. However, some of the edges may be blocked at certain times, and the traveler only observes that upon reaching an adjacent site of the blocked edge. Let ℘={P G (s,t)} be the set of all paths from s to t. The risk of a path is defined as the longest travel under the assumption that any edge of the path may be blocked. The paper will propose the Anti-risk Path Problem of finding a path P G (s,t) in ℘ such that it has minimum risk. We will show that this problem can be solved in O(mn+n 2log n) time suppose that at most one edge may be blocked, where n and m denote the number of vertices and edges in G, respectively.

Keywords: Shortest path; Shortest path tree; Most vital real time edge; Anti-risk path (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9110-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:17:y:2009:i:3:d:10.1007_s10878-007-9110-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9110-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().