Finding a Most Vital Node of a Shortest Path. Nardelli, E., Proietti, G., & Widmayer, P. In Proceedings of the 7th Annual International Conference on Computing and Combinatorics (COCOON) 2001, volume 2108, of LNCS, pages 278-287, 2001. Springer.
bibtex   
@INPROCEEDINGS{E.Nardelli2001IP,
  author = {E. Nardelli and G. Proietti and P. Widmayer},
  title = {{F}inding a {M}ost {V}ital {N}ode of a {S}hortest {P}ath.},
  booktitle = {Proceedings of the 7th Annual International Conference on Computing
	and Combinatorics (COCOON) 2001},
  year = {2001},
  editor = {Jie Wang},
  volume = {2108},
  series = {LNCS},
  pages = {278-287},
  publisher = {Springer}
}

Downloads: 0