Eccentricity approximating trees
From MaRDI portal
Publication:2410233
DOI10.1016/j.dam.2017.07.017zbMath1372.05033OpenAlexW2750540289MaRDI QIDQ2410233
Feodor F. Dragan, H. Alrasheed, Ekkehard Köhler
Publication date: 17 October 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.07.017
chordal graphsapproximation algorithmsvertex eccentricity\(\alpha_1\)-metriceccentricity approximating treesmetric graph classes
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25)
Related Items (7)
Injective hulls of various graph classes ⋮ Helly-gap of a graph and vertex eccentricities ⋮ Eccentricity terrain of \(\delta\)-hyperbolic graphs ⋮ Easy computation of eccentricity approximating trees ⋮ An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Eccentricity function in distance-hereditary graphs
Uses Software
Cites Work
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- On local convexity in graphs
- Eccentricity-approximating trees in chordal graphs
- Graphs of some CAT(0) complexes
- Eccentricity Approximating Trees
- Conditions for invariance of set diameters under d-convexification in a graph
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- 1-Hyperbolic Graphs
- Additive Tree Spanners
- Distance approximating spanning trees
- Collective dynamics of ‘small-world’ networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Eccentricity approximating trees