643 search results - page 113 / 129 » Supereulerian planar graphs |
JCT
2007
13 years 7 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
CCECE
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper we investigate the limits of routing according to left- or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits ...
ICCV
2001
IEEE
14 years 9 months ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...