Solving the all-pairs-shortest-length problem on chordal bipartite graphs☆
References (17)
- et al.
All-pairs-shortest-length on strongly chordal graphs
Discrete Appl. Math.
(1996) Solving the shortest-paths problem on bipartite permutation graphs efficiently
Inform. Process. Lett.
(1995)- et al.
Matrix multiplication via arithmetic progressions
J. Symbolic Comput.
(1990) Characterizations of strongly chordal graphs
Discrete Math.
(1983)On the all-pairs-shortest-path problem in unweighted undirected graphs
J. Comput. System Sci.
(1995)Doubly lexical orderings of dense 0–1 matrices
Inform. Process. Lett.
(1993)Special graph classes—a survey
Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
There are more references available in the full text version of this article.
Cited by (6)
O (1) query time algorithm for all pairs shortest distances on permutation graphs
2007, Discrete Applied MathematicsEstimating all pairs shortest paths in restricted graph families: A unified approach
2005, Journal of AlgorithmsSome optimization problems on weak-bisplit graphs
2003, Information Processing LettersAccelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units
2022, Multimedia Tools and ApplicationsAn all-pairs shortest path algorithm for bipartite graphs
2013, Open Computer ScienceEstimating all pairs shortest paths in restricted graph families: A unified approach
2001, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
This work was partially supported by the National Science Council of Taiwan under grant NSC87-2213-E-008-017. We would like to thank the anonymous referees for helping us improve the presentation of this paper.
Copyright © 1999 Published by Elsevier B.V.