2365 search results - page 90 / 473 » All things are connected |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
114
click to vote
COMBINATORICA
2000
15 years 1 months ago
2000
Given a connected graph, X, we denote by 2 = 2(X) its smallest non-zero Laplacian eigenvalue. In this paper we show that among all sets of n - 1 transpositions which generate the ...
105
click to vote
DM
2002
15 years 1 months ago
2002
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
107
click to vote
SIAMCOMP
2002
15 years 1 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
109
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...