scientific article; zbMATH DE number 2044927

MaRDI QIDQ4448751zbMATH OpenFDO

Authors Feodor F. Dragan

Publication date 18 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040103.htm

Mathematics Subject Classification ID

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

Recommendations

• Estimating all pairs shortest paths in restricted graph families: a unified approach
• Unified all-pairs shortest path algorithms in the chordal hierarchy
• All-pairs shortest paths for unweighted undirected graphs in o(mn) time
• All-pairs-shortest-length on strongly chordal graphs
• All pairs shortest paths for graphs with small integer length edges

Cited in

(4)

• Unified all-pairs shortest path algorithms in the chordal hierarchy
• Additive sparse spanners for graphs with bounded length of largest induced cycle
• Estimating all pairs shortest paths in restricted graph families: a unified approach
• Unrestricted and complete breadth-first search of trapezoid graphs in O(n) time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448751)