Sciweavers

2 search results - page 1 / 1
» The Absence of Efficient Dual Pairs of Spanning Trees in Pla...
Sort
View
COMBINATORICS
2006
153views more  COMBINATORICS 2006»
13 years 3 months ago
The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
T. R. Riley, William P. Thurston
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 3 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid