Optimal one-page tree embeddings in linear time

In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 2003-07, Vol.87 (2), p.59-66
Hauptverfasser:	Hochberg, Robert A., Stallmann, Matthias F.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Anchored tree Applied sciences Combinatorics Combinatorics. Ordered structures Computer science control theory systems Embedded systems Exact sciences and technology Graph theory Information retrieval. Graph Linear programming Mathematics One-page embedding Optimal embedding Sciences and techniques of general use Studies Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!