Orderly Spanning Trees with Applications

We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing Jg. 34; H. 4; S. 924 - 945
Hauptverfasser:	Chiang, Yi-Ting, Lin, Ching-Chi, Lu, Hsueh-I
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2005
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Data compression Data processing. List processing. Character string processing Exact sciences and technology Graph theory Graphs Information retrieval. Graph Mathematics Memory organisation. Data processing Sciences and techniques of general use Software Theoretical computing 68P05 Isomorphic graph Tree(graph) Realizer Data compression Algorithmics Connected graph Linear time 68U05 Computing 94C15 Graph drawing Graph encoding Data structure visibility representation succinct data structure unit-cost RAM model Triangulation 68W35 Planar graph 05C85 orderly spanning tree data compression 05C62 Spanning tree Canonical ordering 68R10 planar graph algorithm
ISSN:	0097-5397, 1095-7111
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!