The above article has been cited by the articles listed below.
Jean-Marie Vanherpe,
Some optimization problems on weak-bisplit graphs ,
Information Processing Letters 88 (2003) 305-310.(*) Feodor F. Dragan,
Estimating all pairs shortest paths in restricted graph families: a unified approach ,
Journal of Algorithms 57 (2005) 1-21.(*) Alan P. Sprague,
O(1) query time algorithm for all pairs shortest distances on permutation graphs ,
Discrete Applied Mathematics 155 (2007) 365-373.(*) William Chung-Kung Yen, Shuo-Cheng Hu, Tai-Chang Chen,
The weighted all-pairs-shortest-path-length problem on two-terminal series-parallel graphs ,
Proceedings of the 25th Workshop on Combinatorial Mathematics and Computation Theory , Hsinchu, Taiwan, April 25-26, 2008, pp. 354-361. Ton Kloks, Ching-Hao Liu, and Sheung-Hung Poon,
Feedback vertex set on chordal bipartite graphs ,
Arxiv preprint arXiv:1104.3915, 2011. Svetlana Torgasin, Karl-Heinz Zimmermann,
An all-pairs shortest path algorithm for bipartite graphs ,
Central European Journal of Computer Science 3 (2013) 149-157.(*) Torgasin, Svetlana,
Graph-based methods for the design of DNA computations ,
Ph.D. Dissertation, Technischen Universität Hamburg-Harburg, 2012. Muhammad Kashif Hanif, Karl-Heinz Zimmermann, Asad Anees,
Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units ,
Multimedia Tools and Applications 81 (2022) 9549-9566.(*)
Times cited: 5