Computing Prüfer codes efficiently in parallel

A Prüfer code of a labeled free tree with n nodes is a sequence of length n−2 constructed by the following sequential process: for i ranging from 1 to n−2 insert the label of the neighbor of the smallest remaining leaf into the ith position of the sequence, and then delete the leaf. Prüfer codes pro...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 102; H. 3; S. 205 - 222
Hauptverfasser:	Greenlaw, Raymond, Petreschi, Rossella
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Lausanne Elsevier B.V 15.06.2000 Amsterdam Elsevier New York, NY
Schlagworte:	Applied sciences Coding, codes Combinatorics Combinatorics. Ordered structures EREW-PRAM algorithms Exact sciences and technology Graph theory Information, signal and communications theory Mathematics Parallel algorithms Prüfer codes Sciences and techniques of general use Signal and communications theory Telecommunications and information theory Trees Trees EREW-PRAM algorithms Prüfer codes Parallel algorithms Labelled graph Optimal time Parallel algorithm Tree(graph) Prufer code Code labelled free tree
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!