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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 102; číslo 3; s. 205 - 222
Hlavní autori:	Greenlaw, Raymond, Petreschi, Rossella
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Lausanne Elsevier B.V 15.06.2000 Amsterdam Elsevier New York, NY
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!