Fast diameter computation within split graphs

DOI10.1007/978-3-030-36412-0_13zbMath1435.68232arXiv1910.03438OpenAlexW2991682571MaRDI QIDQ2180143

Laurent Viennot, Guillaume Ducoffe, Michel A. Habib

Publication date: 13 May 2020

Full work available at URL: https://arxiv.org/abs/1910.03438

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ Eccentricity queries and beyond using hub labels ⋮ A faster diameter problem algorithm for a chordal graph, with a connection to its center problem ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ The diameter of AT‐free graphs ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Fast Diameter Computation within Split Graphs

This page was built for publication: Fast diameter computation within split graphs