20 search results - page 2 / 4 » Long cycles and paths in distance graphs |
TCS
2010
13 years 6 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
IM
2007
13 years 7 months ago
2007
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
CCCG
2008
13 years 9 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
SIAMCOMP
2000
13 years 7 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...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...