2354 search results - page 85 / 471 » Radio number for trees |
165
click to vote
CGF
1999
15 years 5 months ago
1999
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
178
click to vote
ECCC
2010
15 years 4 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
158
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
166
click to vote
CPC
2006
15 years 6 months ago
2006
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
131
click to vote
CGF
1998
15 years 5 months ago
1998
Information visualisation often requires good navigation aids on large trees, which represent the underlying information. Using trees for information visualisation requires novel ...