On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices

DOI10.1007/978-3-540-69068-9_17MaRDI QIDQ3506951zbMATH OpenOpenAlexFDO

Authors Igor Nitto, Rossano Venturini

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69068-9_17

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• On compact representations of all-pairs-shortest-path-distance matrices
• On the all-pairs-shortest-path problem in unweighted undirected graphs.
• All-pairs shortest paths for unweighted undirected graphs in o(mn) time
• Succinct Representations of Arbitrary Graphs
• Shortest-Path Reconstruction Algorithms

Cited in

(4)

• External matrix multiplication and all-pairs shortest path
• Compact navigation and distance oracles for graphs with small treewidth
• Succinct enumeration of distant vertex pairs
• On compact representations of all-pairs-shortest-path-distance matrices

This page was built for publication: On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices

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