EconPapers    
Economics at your fingertips  
 

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

Bing Su (), Qingchuan Xu () and Peng Xiao ()
Additional contact information
Bing Su: Xi’an JiaoTong University
Qingchuan Xu: Xi’an JiaoTong University
Peng Xiao: Xi’an JiaoTong University

Journal of Combinatorial Optimization, 2008, vol. 16, issue 2, No 7, 173-181

Abstract: Abstract Let P G (s,t) denote a shortest path between two nodes s and t in an undirected graph G with nonnegative edge weights. A detour at a node u∈P G (s,t)=(s,…,u,v,…,t) is defined as a shortest path P G−e (u,t) from u to t which does not make use of (u,v). In this paper, we focus on the problem of finding an edge e=(u,v)∈P G (s,t) whose removal produces a detour at node u such that the ratio of the length of P G−e (u,t) to the length of P G (u,t) is maximum. We define such an edge as an anti-block vital edge (AVE for short), and show that this problem can be solved in O(mn) time, where n and m denote the number of nodes and edges in the graph, respectively. Some applications of the AVE for two special traffic networks are shown.

Keywords: Edge failures; Shortest path; Anti-block vital edge (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9120-2 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:16:y:2008:i:2:d:10.1007_s10878-007-9120-2

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

DOI: 10.1007/s10878-007-9120-2

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 ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:16:y:2008:i:2:d:10.1007_s10878-007-9120-2