Easy computation of eccentricity approximating trees
type: Item
instance of: scholarly article
title: Easy computation of eccentricity approximating trees
zbMATH Open document ID: 1409.05052
author: Guillaume Ducoffe
published in: Discrete Applied Mathematics
publication date: 2019-05-03T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7051008
zbMATH Keywords: eccentricity-approximating tree
zbMATH Keywords: shortest-path tree
zbMATH Keywords: complexity
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2019.01.006
OpenAlex ID: W2914168686
cites work: Q5422499
cites work: Distance Approximating Trees for Chordal and Dually Chordal Graphs
cites work: Graphs with all diametral paths through distant central nodes
cites work: Finding a central vertex in an HHD-free graph
cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
cites work: Fast approximation of centrality and distances in hyperbolic graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
cites work: Eccentricity approximating trees
cites work: Algorithms and Computation
cites work: Collective Tree Spanners and Routing in AT-free Related Graphs
cites work: Collective tree spanners of graphs
cites work: Q3772406
cites work: Additive Tree Spanners
cites work: Q4712944
cites work: Eccentricity-approximating trees in chordal graphs
DOI: 10.1016/J.DAM.2019.01.006
description: scientific article; zbMATH DE number 7051008