3702 search results - page 200 / 741 » All Pairings Are in a Group |
128
click to vote
ENDM
2007
15 years 6 months ago
2007
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...
133
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, and with every pair of points occurring in a unique block; for a fixed K, B(K) i...
175
click to vote
MLQ
2002
15 years 6 months ago
2002
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to...
171
click to vote
EJC
2007
15 years 6 months ago
2007
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid. The purpose of this ...
181
click to vote
IPL
2010
15 years 5 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...