scientific article; zbMATH DE number 1735659

zbMath0993.68033MaRDI QIDQ4329049

Narsingh Deo, Paulius Micikevicius

Publication date: 29 September 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Prüfer-like codes

Mathematics Subject Classification ID

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

Related Items (7)

On coding labeled trees ⋮ Graph universal cycles: compression and connections to universal cycles ⋮ The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses ⋮ Encoding trees by linear recurrence sequences ⋮ Unified parallel encoding and decoding algorithms for Dandelion-like codes ⋮ A clique-difference encoding scheme for labelled \(k\)-path graphs ⋮ The Reduced Prüfer Code for Rooted Labelled k-Trees

This page was built for publication: