Suchergebnisse - "G.2.1 Combinatorics- Combinatorial algorithms"
-
1
Maximum Entropy Summary Trees
ISSN: 0167-7055, 1467-8659Veröffentlicht: Oxford, UK Blackwell Publishing Ltd 01.06.2013Veröffentlicht in Computer graphics forum (01.06.2013)“… Given a very large, node‐weighted, rooted tree on, say, n nodes, if one has only enough space to display a k‐node summary of the tree, what is the most …”
Volltext
Journal Article