Efficient Prüfer-Like Coding and Counting Labelled Hypertrees

DOI10.1007/11940128_59zbMATH Open1135.68525OpenAlexW1964024101MaRDI QIDQ5459153FDOQ5459153

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

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

zbMATH Keywords

countinghypertreecoding\(r\)-uniformPrüfer code

Mathematics Subject Classification ID

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

Cited In (3)

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

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)