scientific article; zbMATH DE number 1735659

MaRDI QIDQ4329049zbMATH OpenFDO

Authors Narsingh Deo, Paulius Micikevicius

Publication date 29 September 2002

zbMATH Keywords

Prüfer-like codes

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Computing Prüfer codes efficiently in parallel
• A generalized enumeration of labeled trees and reverse Prüfer algorithm
• An efficient algorithm for generating Prüfer codes from labelled trees
• scientific article; zbMATH DE number 1507236
• LATIN 2004: Theoretical Informatics

Cited in

(20)

• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm
• On the locality of the Prüfer code
• An extension of the Prüfer code and assembly of connected graphs from their blocks
• Computing Prüfer codes efficiently in parallel
• Encoding trees by linear recurrence sequences
• Colored Prüfer codes for k-edge colored trees
• An efficient algorithm for generating Prüfer codes from labelled trees
• From words to graphs, and back
• On coding labeled trees
• Linear-time algorithms for encoding trees as sequences of node labels
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• Prüfer code for chordal graphs
• scientific article; zbMATH DE number 1744078 (Why is no real title available?)
• Is Prüfer code encoding always a bad idea?
• Computing and Combinatorics
• LATIN 2004: Theoretical Informatics
• Graph universal cycles: compression and connections to universal cycles
• The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
• Unified parallel encoding and decoding algorithms for Dandelion-like codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4329049)