Easy computation of eccentricity approximating trees

A spanning tree T of a graph G=(V,E) is called eccentricityk-approximating if we have eccT(v)≤eccG(v)+k for every v∈V. Let ets(G) be the minimum k such that G admits an eccentricity k-approximating spanning tree. As our main contribution in this paper, we prove that ets(G) can be computed in O(nm)-t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2019-05, Vol.260, p.267-271
1. Verfasser:	Ducoffe, Guillaume
Format:	Artikel
Sprache:	eng
Schlagworte:	Approximation Complexity Computational Complexity Computer Science Data Structures and Algorithms Discrete Mathematics Eccentricity Eccentricity-approximating tree Ethernet Graph algorithms Graph theory Graphs Shortest-path problems Shortest-path tree Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!