Finding the most vital node of a shortest path

Theoretical Computer Science

Volumn 296, Issue 1, 2003, Pages 167-177

  Nardelli, Enrico ^a,b   Proietti, Guido ^a,b   Widmayer, Peter ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b CNR   (Italy)

^c ETH ZURICH   (Switzerland)

Author keywords

Mechanism design; Network survivability; Node vitality; Shortest path

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; PROBLEM SOLVING;

NETWORK SURVIVABILITY;

COMPUTER SCIENCE;

EID: 0037271460     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00438-3     Document Type: Conference Paper

References (14)

1. Ball M.O., Golden B.L., Vohra R.V. Finding the most vital arcs in a network. Oper. Res. Lett. 8:1989;73-76.
2. A. Bar-Noy, S. Khuller, B. Schieber, The complexity of finding most vital arcs and nodes, TR CS-TR-3539, Institute for Advanced Studies, University of Maryland, College Park, MD, 1995.
3. Corley H.W., Sha D.Y. Most vital links and nodes in weighted networks. Oper. Res. Lett. 1:1982;157-160.
4. Dijkstra E.W. A note on two problems in connection with graphs. Numer. Math. 1:1959;269-271.
5. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM. 34(3):1987;596-615.
6. J. Hershberger, S. Suri, Vickrey prices and shortest paths: what is an edge worth? Proc. 42nd Annu. IEEE Symp. on Foundations of Computer Science (FOCS'01), 2001, pp. 252-260.
7. Malik K., Mittal A.K., Gupta S.K. The. k most vital arcs in the shortest path problem Oper. Res. Lett. 8:1989;223-227.
8. Nardelli E., Proietti G., Widmayer P. Finding the detour-critical edge of a shortest path between two nodes. Inform. Process. Lett. 67(1):1998;51-54.
9. Nardelli E., Proietti G., Widmayer P. A faster computation of the most vital edge of a shortest path between two nodes. Inform. Process. Lett. 79(2):2001;81-85.
10. Nisan N. Algorithms for selfish agents, Proc. 16th Symp. on Theoretical Aspects of Computer Science (STACS'99), Lecture Notes in Comput. Sci. vol. 1563:1999;1-15 Springer, Berlin.
11. N. Nisan, A. Ronen, Algorithmic mechanism design, Proc. 31st Annu. ACM Symp. on Theory of Computing (STOC'99), 1999, pp. 129-140.
12. Rosenschein J.S., Zlotkin G. Rules of Encounter. Designing Conventions for Automated Negotiation Among Computers:1994;MIT Press, Cambridge, MA.
13. Tarjan R.E. Efficiency of a good but not linear set union algorithm. J. ACM. 22:1975;215-225.
14. S. Venema, H. Shen, F. Suraweera, A parallel algorithm for the single most vital vertex problem with respect to single source shortest paths, Online Proc. First Internat. Conf. on Parallel and Distributed Computing, Applications and Technologies (PDCAT'2000), Chapter 22, http://www2.comp.polyu.edu.hk/PDCAT2000/publish.html.