123 search results - page 5 / 25 » Embedding of Hypercubes into Grids |
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
GD
2009
Springer
14 years 2 days ago
2009
Springer
We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n − 2) × (n − 2) grid. Further, we present a simple algorithm to obtain a...
DM
2007
13 years 7 months ago
2007
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...