Eccentricity function in distance-hereditary graphs

DOI10.1016/j.tcs.2020.05.004zbMath1453.05026arXiv1907.05445OpenAlexW2959517763MaRDI QIDQ784475

Feodor F. Dragan, Heather M. Guarnera

Publication date: 3 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

centerdiameterradiusdistance-hereditary graphlinear-time algorithmeccentricity function

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ Helly-gap of a graph and vertex eccentricities

Cites Work

• Unnamed Item
• Centers of triangulated graphs
• Distance-hereditary graphs
• Eccentricity-approximating trees in chordal graphs
• Centers and medians of distance-hereditary graphs
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
• An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
• Eccentricity terrain of \(\delta\)-hyperbolic graphs
• Eccentricity approximating trees
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Centers of 2–Trees
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Centers of maximal outerplanar graphs
• Convexity and HHD-Free Graphs
• Fast approximation of eccentricities and distances in hyperbolic graphs
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
• Distance approximating spanning trees
• Dominating cliques in distance-hereditary graphs
• Network Analysis
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs

This page was built for publication: Eccentricity function in distance-hereditary graphs