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

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 102; no. 3; pp. 205 - 222
Main Authors:	Greenlaw, Raymond, Petreschi, Rossella
Format:	Journal Article
Language:	English
Published:	Lausanne Elsevier B.V 15.06.2000 Amsterdam Elsevier New York, NY
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!