Estimating all pairs shortest paths in restricted graph families: a unified approach

DOI10.1016/j.jalgor.2004.09.002zbMath1105.68087OpenAlexW2109370679MaRDI QIDQ5704853

Feodor F. Dragan

Publication date: 16 November 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.09.002

zbMATH Keywords

weakly chordal graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ How to use spanning trees to navigate in graphs ⋮ Distributed computing of efficient routing schemes in generalized chordal graphs ⋮ An all-pairs shortest path algorithm for bipartite graphs ⋮ An improved algorithm for the longest induced path problem on \(k\)-chordal graphs ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs ⋮ Fast Diameter Computation within Split Graphs

This page was built for publication: Estimating all pairs shortest paths in restricted graph families: a unified approach