An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
From MaRDI portal
Publication:2011037
DOI10.1016/J.IPL.2019.105873zbMATH Open1481.05029OpenAlexW2981494155MaRDI QIDQ2011037FDOQ2011037
Authors: Feodor F. Dragan 
Publication date: 28 November 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105873
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Convexity in Graphs and Hypergraphs
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Diameter determination on restricted graph families
- Algorithmic Aspects of Vertex Elimination on Graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Eccentricity-approximating trees in chordal graphs
- LexBFS-orderings and powers of chordal graphs
- Eccentricity approximating trees
- Title not available (Why is that?)
- Easy computation of eccentricity approximating trees
- Fast approximation of centrality and distances in hyperbolic graphs
- On the power of BFS to determine a graph's diameter
Cited In (9)
- Eccentricity terrain of \(\delta\)-hyperbolic graphs
- Eccentricity approximating trees
- Easy computation of eccentricity approximating trees
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities
- A story of diameter, radius, and (almost) Helly property
- Eccentricity approximating trees (extended abstract)
- Helly-gap of a graph and vertex eccentricities
- $$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
- Eccentricity function in distance-hereditary graphs
This page was built for publication: An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011037)
