Efficient Prüfer-like coding and counting labelled hypertrees

DOI10.1007/s00453-007-9137-zzbMath1185.68497OpenAlexW2616312070MaRDI QIDQ1022347

Sudebkumar Prasant Pal, Saswata Shannigrahi

Publication date: 22 June 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9137-z

zbMATH Keywords

countingcodinghypertreePrüfer code\(r\)-uniform

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Spanning trees in random regular uniform hypergraphs ⋮ The average number of spanning hypertrees in sparse uniform hypergraphs

Cites Work

• Computing Prüfer codes efficiently in parallel
• An efficient algorithm for generating Prüfer codes from labelled trees
• Quantum Entanglement and Communication Complexity
• A combinatorial approach for studying local operations and classical communication transformations of multipartite states
• Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Prüfer-like coding and counting labelled hypertrees