409 search results - page 18 / 82 » Odd Crossing Number and Crossing Number Are Not the Same |
CIARP
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Distinguished regions can be detected with high repeatability in different images of the same scene. Two definitions of distinguished regions of an image in a mathemati...
GD
2006
Springer
13 years 11 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
GD
2003
Springer
14 years 22 days ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
ANOR
2005
13 years 7 months ago
2005
This paper addresses the problem of loading a finite capacity, stochastic (random) and dynamic multi-project system. The system is controlled by keeping a constant number of projec...
GD
2007
Springer
14 years 1 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...