641 search results - page 55 / 129 » On Planar Quasi-Parity Graphs |
144
click to vote
ACSC
2007
IEEE
16 years 14 days ago
2007
IEEE
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
163
click to vote
JDA
2010
15 years 4 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
148
click to vote
CCCG
2010
15 years 7 months ago
2010
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
141
click to vote
STOC
1990
ACM
15 years 10 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
144
click to vote
NIPS
1996
15 years 7 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...