Line-Distortion, Bandwidth and Path-Length of a Graph

For a graph G = ( V , E ) the minimum line-distortion problem asks for the minimum k such that there is a mapping f of the vertices into points of the line such that for each pair of vertices x ,  y the distance on the line | f ( x ) - f ( y ) | can be bounded by the term d G ( x , y ) ≤ | f ( x ) -...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2017-03, Vol.77 (3), p.686-713
Hauptverfasser:	Dragan, Feodor F., Köhler, Ekkehard, Leitert, Arne
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Bandwidths Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!