641 search results - page 30 / 129 » On Planar Quasi-Parity Graphs |
192
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
145
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
189
click to vote
EJC
2011
15 years 1 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
155
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
131
click to vote
GD
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...