The following pages link to On coding labeled trees (Q2381521):
Displaying 8 items.
- Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Enumerating vertices of the balanced minimum evolution polytope (Q2003580) (← links)
- A tutorial on the balanced minimum evolution problem (Q2670555) (← links)
- A statistic related to trees and words on a finite alphabet (Q3178161) (← links)
- Coding Through a Two Star and Super Mean Labeling (Q3296828) (← links)
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem (Q6106606) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
