26 search results - page 1 / 6 » Edge Disjoint Graph Spanners of Complete Graphs and Complete... |
HICSS
1997
IEEE
13 years 9 months ago
1997
IEEE
ECCC
2010
13 years 10 days ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
CPC
2008
13 years 5 months ago
2008
In 1998 Luczak, R
COMGEO
2007
ACM
13 years 5 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...
ISAAC
2004
Springer
13 years 10 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...