3 search results - page 1 / 1 » Nearly light cycles in embedded graphs and crossing-critical... |
JGT
2006
13 years 4 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
COMBINATORICA
2010
13 years 2 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
DATE
2005
IEEE
13 years 10 months ago
2005
IEEE
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...