1215 search results - page 92 / 243 » Combinatorics |
COCOON
2010
Springer
15 years 8 months ago
2010
Springer
A universal cycle for the k-permutations of n = {1, 2, ..., n} is a circular string of length nk that contains each k-permutation exactly once as a substring. Jackson (Discrete Mat...
110
Voted
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
We use nontrivial connections between the theory of computing and the finescale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in f...
131
click to vote
CPM
2008
Springer
15 years 5 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
CPM
2009
Springer
15 years 10 months ago
2009
Springer
121
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs