5473 search results - page 1 / 1095 » On the graph isomorphism problem |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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...
MST
2011
12 years 8 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
CORR
2008
Springer
13 years 5 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...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
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 ...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...