725 search results - page 60 / 145 » Bounding Degrees on RPL |
110
click to vote
COMBINATORICA
2008
15 years 24 days ago
2008
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
113
click to vote
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
110
click to vote
EJC
2008
15 years 23 days ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
99
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
101
click to vote
COMBINATORICA
2007
15 years 21 days ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...