Computing Giant Graph Diameters

DOI10.1007/978-3-319-44543-4_29zbMath1478.68228OpenAlexW2516649936MaRDI QIDQ2819520

Peter Damaschke

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44543-4_29

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (2)

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ Beyond Helly graphs: the diameter problem on absolute retracts

Uses Software

• Algorithm 447

Cites Work

• Almost diameter of a house-hole-free graph in linear time via LexBFS
• A simple test on 2-vertex- and 2-edge-connectivity
• On the power of BFS to determine a graph's diameter
• Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
• Fast and Simple Approximation of the Diameter and Radius of a Graph
• Approximating the Diameter of Planar Graphs in Near Linear Time
• Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
• Algorithms – ESA 2005
• Fast approximation algorithms for the diameter and radius of sparse graphs
• Sequential Minimax Search for a Maximum
• Diameter determination on restricted graph families

This page was built for publication: Computing Giant Graph Diameters