Efficient Prüfer-Like Coding and Counting Labelled Hypertrees

DOI10.1007/11940128_59MaRDI QIDQ5459153zbMATH OpenOpenAlexFDO

Authors Saswata Shannigrahi, Sudebkumar Prasant Pal

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_59

zbMATH Keywords

\(r\)-uniformcodingcountinghypertreePrüfer code

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient Prüfer-like coding and counting labelled hypertrees
• LATIN 2004: Theoretical Informatics
• On coding labeled trees
• An efficient algorithm for generating Prüfer codes from labelled trees
• The Reduced Prüfer Code for Rooted Labelled k-Trees

Cited in

(3)

• Efficient Prüfer-like coding and counting labelled hypertrees
• Propagation Connectivity of Random Hypergraphs
• Counting and coding identity trees with fixed diameter and bounded degree

This page was built for publication: Efficient Prüfer-Like Coding and Counting Labelled Hypertrees

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