Succinct enumeration of distant vertex pairs

DOI10.1142/S1793830919500769zbMath1427.05076OpenAlexW2980236550WikidataQ127112826 ScholiaQ127112826MaRDI QIDQ5207511

Ali Gholami Rudi

Publication date: 2 January 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500769

zbMATH Keywords

graph algorithmsall pairs shortest pathgraph diametersuccinct data structuresmemory complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• On Computing the Gromov Hyperbolicity
• Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier
• On Computing the Hyperbolicity of Real-World Graphs
• On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
• Simpler, faster and shorter labels for distances in graphs
• Approximating the Diameter of Planar Graphs in Near Linear Time
• Better Approximation Algorithms for the Graph Diameter

This page was built for publication: Succinct enumeration of distant vertex pairs