Bijective linear time coding and decoding for \(k\)-trees
From MaRDI portal
Publication:970106
DOI10.1007/s00224-008-9131-0zbMath1209.68356WikidataQ114230790 ScholiaQ114230790MaRDI QIDQ970106
Emanuele G. Fusco, Rossella Petreschi, Saverio Caminiti
Publication date: 10 May 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9131-0
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bijections for Cayley trees, spanning trees, and their q-analogues
- A coding algorithm for Rényi trees
- Cayley's formula for multidimensional trees
- A partial k-arboretum of graphs with bounded treewidth
- On simple characterizations of k-trees
- On coding labeled trees
- Enumerating k-trees
- The Reduced Prüfer Code for Rooted Labelled k-Trees
- A general bijective algorithm for trees.
- A Bijective Code for k-Trees with Linear Time Encoding and Decoding
- Jewels of Stringology
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
- The number of labeled k-trees
- Computing and Combinatorics
- LATIN 2004: Theoretical Informatics