All-pairs-shortest-length on strongly chordal graphs

DOI10.1016/0166-218X(95)00088-9zbMath0868.68084OpenAlexW2092349585MaRDI QIDQ1923609

C. Pandu Rangan, V. Balachandhran

Publication date: 9 October 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

strongly chordal graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (3)

Solving the all-pairs-shortest-length problem on chordal bipartite graphs ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Optimally fast shortest path algorithms for some classes of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of strongly chordal graphs
• A new algorithm to find the shortest paths between all pairs of nodes
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• Triangulated graphs and the elimination process
• Three Partition Refinement Algorithms
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: All-pairs-shortest-length on strongly chordal graphs