2 search results - page 1 / 1 » The Absence of Efficient Dual Pairs of Spanning Trees in Pla... |
COMBINATORICS
2006
13 years 11 months ago
2006
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...
SIAMCOMP
2000
13 years 10 months ago
2000
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...