Pages that link to "Item:Q1207762"
From MaRDI portal
The following pages link to A coding algorithm for Rényi trees (Q1207762):
Displaying 14 items.
- An improvement of the tree code construction (Q845688) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468) (← links)
- Enumeration of labelled \((k,m)\)-trees (Q1284483) (← links)
- Enumerating \(k\)-way trees (Q1313764) (← links)
- Encoding trees by linear recurrence sequences (Q1699391) (← links)
- Colored Prüfer codes for \(k\)-edge colored trees (Q1773178) (← links)
- Non-malleable codes for decision trees (Q2181859) (← links)
- The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323) (← links)
- A general bijective algorithm for trees. (Q3487361) (← links)
- Tree-Based Encoding for Cancellations on Morse Complexes (Q3651625) (← links)
- (Q4489231) (← links)
- A New Coding Algorithm for Trees (Q4542812) (← links)
- Counting and enumerating unlabeled split–indifference graphs (Q5370830) (← links)