242 search results - page 36 / 49 » Object-level Vertical Search |
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
112
click to vote
ANTSW
2004
Springer
15 years 1 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
120
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
COMGEO
2007
ACM
14 years 9 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...