A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs

Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Justie Su-tzu Juan. A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs. Algorithmica, 61(2):402-418, 2011. [doi]

@article{KaoCWJ11,
  title = {A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs},
  author = {Kuo-Hua Kao and Jou-Ming Chang and Yue-Li Wang and Justie Su-tzu Juan},
  year = {2011},
  doi = {10.1007/s00453-010-9402-4},
  url = {http://dx.doi.org/10.1007/s00453-010-9402-4},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KaoCWJ11},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {61},
  number = {2},
  pages = {402-418},
}