Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs

On sparse graphs, Roditty and Williams [2013] proved that no O ( n 2 - ε ) -time algorithm achieves an approximation factor smaller than 3 2 for the diameter problem unless SETH fails. In this article, we solve an open question formulated in the literature: can we use the structural properties of me...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 68; no. 1; pp. 144 - 193
Main Authors:	Bergé, Pierre, Ducoffe, Guillaume, Habib, Michel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2024 Springer Nature B.V Springer Verlag
Subjects:	Algorithms Combinatorial analysis Computer Science Data Structures and Algorithms Diameters Eccentricity Graph theory Graphs Hypercubes Run time (computers) Theory of Computation Median graphs Hypercubes Eccentricities Diameter
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!