Sciweavers

Share
220 search results - page 1 / 44
» Subgraph Isomorphism in Planar Graphs and Related Problems
Sort
View
CORR
1999
Springer
145views Education» more  CORR 1999»
9 years 5 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
CORR
2008
Springer
123views Education» more  CORR 2008»
9 years 6 months ago
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
Shmuel Friedland
STACS
2010
Springer
10 years 26 days ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is deļ¬ned 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...
Frederic Dorn
RELMICS
2000
Springer
9 years 9 months ago
A Relational View of Subgraph Isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
Jordi Cortadella, Gabriel Valiente
CORR
2008
Springer
135views Education» more  CORR 2008»
9 years 6 months ago
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
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...
Thomas Thierauf, Fabian Wagner
books