Efficient Prüfer-Like Coding and Counting Labelled Hypertrees

DOI10.1007/11940128_59zbMath1135.68525OpenAlexW1964024101MaRDI QIDQ5459153

Sudebkumar Prasant Pal, Saswata Shannigrahi

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

countingcodinghypertreePrüfer code\(r\)-uniform

Mathematics Subject Classification ID

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

Related Items (1)

Propagation Connectivity of Random Hypergraphs

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