Pages that link to "Item:Q970106"
From MaRDI portal
The following pages link to Bijective linear time coding and decoding for \(k\)-trees (Q970106):
Displaying 5 items.
- A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468) (← links)
- A coding algorithm for Rényi trees (Q1207762) (← links)
- Efficient learning of Bayesian networks with bounded tree-width (Q2374540) (← links)
- The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323) (← links)
- Learning Bounded Tree-Width Bayesian Networks via Sampling (Q3451198) (← links)