::::k::::-Link Shortest Paths in Weighted Subdivisions

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. ::::k::::-Link Shortest Paths in Weighted Subdivisions. In Frank K. H. A. Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack, editors, Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings. Volume 3608 of Lecture Notes in Computer Science, pages 325-337, Springer, 2005. [doi]

@inproceedings{DaescuMNPY05,
  title = {::::k::::-Link Shortest Paths in Weighted Subdivisions},
  author = {Ovidiu Daescu and Joseph S. B. Mitchell and Simeon C. Ntafos and James D. Palmer and Chee-Keng Yap},
  year = {2005},
  doi = {10.1007/11534273_29},
  url = {http://dx.doi.org/10.1007/11534273_29},
  tags = {C++},
  researchr = {https://researchr.org/publication/DaescuMNPY05},
  cites = {0},
  citedby = {0},
  pages = {325-337},
  booktitle = {Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
  editor = {Frank K. H. A. Dehne and Alejandro López-Ortiz and Jörg-Rüdiger Sack},
  volume = {3608},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-28101-0},
}