A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs
Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, and Justie Su-Tzu Juan
Algorithmica, Vol. 61, No. 2 (2011) pp. 402-418.

The above article has been cited by the articles listed below.
  1. Bang Ye Wu, A simpler and more efficient algorithm for the next-to-shortest path problem, Proceedings of 4th International Conference on Combinatorial Optimization and Applications (COCOA 2010) Kailua-Kona, HI, USA, Dec. 18-20, 2010, pp. 219-227. (*)

  2. Cong Zhang, Hiroshi Nagamochi, The next-to-shortest path in undirected graphs with nonnegative weights, Proceedings of the Eighteenth Computing: The Australasian Theory Symposium (CATS 2012) Melbourne, Australia, 30 Jan - 2 Feb, 2012, pp. 13-20 (TR2011-012).

  3. Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang, A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths, arXiv preprint arXiv:1203.5235, 2012.

  4. Bang Ye Wu, A simpler and more efficient algorithm for the next-to-shortest path problem, Algorithmica 65 (2013) 467-479. (*)

  5. Ling Zhang, Yuan-ting Yan, Shu Zhao, Yan-ping Zhang, Network performance analysis based on quotient space theory, Proceedings of 14th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2013), Lecture Notes in Computer Science 8170 (2013) pp 216-224. (*)

  6. Alexander Plutov, Michael Segal, The delta-betweenness centrality, Proceedings of IEEE 24th International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC 2013), London, United Kingdom, 8-11 Sept. 2013, pp 3376-3380. (*)

  7. Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane, Canadians should travel randomly, Proceedings of 41st International Colloquium on Automata, Languages and Programming (ICALP 2014), Copenhagen, Denmark, July 8-11, 2014, Lecture Notes in Computer Science 8572 (2014), pp 380-391. (*)

  8. Qinghong Zeng, Qiaoyan Yang, The polynomial time algorithm of the next-to-shortest path problem in directed graph, PPH International Conference on Social Science and Environment (PPH-SSE 2016) Vol.2, (2016) 89-92. (*)

  9. Bang Ye Wu, Hung-Lung Wang, The next-to-shortest path problem on directed graphs with positive edge weights, Networks 65 (2015) 205-211. (*)

  10. Xi Wang, Jianxi Fan, Xiaohua Jia, Cheng-Kuan Lin, An efficient algorithm to construct disjoint path covers of DCell networks, Theoretical Computer Science 609 (2016) 197-210. (*)

  11. Alexandre Dolgui Mikhail Y. Kovalyov Alain Quilliot, Simple paths with exact and forbidden lengths, Naval Research Logistics 65 (2018) 78-85. (*)

  12. Erik D. Demaine, Yamming Huang, Chung-Shou Liao, Kunihiko Sadakane, Approximating the Canadian traveller problem with online randomization, Algorithmica 83 (2021) 1524-1543. (*)

Times cited: 10 (from Web of Science)