Journal of the ACM (JACM)
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Isomorphism for graphs embeddable on the projective plane
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Faster isomorphism testing of strongly regular graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Information and Computation
Distortion Invariant Object Recognition in the Dynamic Link Architecture
IEEE Transactions on Computers
Isomorphism of graphs with bounded eigenvalue multiplicity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Maximum s-t-flow with k crossings in O(k3n log n) time
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Motorcycle graphs: canonical quad mesh partitioning
SGP '08 Proceedings of the Symposium on Geometry Processing
Fast digital signature algorithm based on subgraph isomorphism
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
From invariants to canonization in parallel
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Errors in graph embedding algorithms
Journal of Computer and System Sciences
Complexity classes of equivalence problems revisited
Information and Computation
From polynomial time queries to graph structure theory
Communications of the ACM
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Isomorphism of (mis)labeled graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
On tractable parameterizations of graph isomorphism
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
ClouDiA: a deployment advisor for public clouds
Proceedings of the VLDB Endowment
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The Graph Isomorphism Problem and approximate categories
Journal of Symbolic Computation
Practical graph isomorphism, II
Journal of Symbolic Computation
| Hi-index | 0.02 |
We present an algorithm which determines isomorphism of graphs in vO(g)steps where v is the number of vertices and g is the genus of the graphs. In [FMR 79] an algorithm was presented for embedding graph on surfaces of genus g in vO(g) steps. Here we show how to extend this algorithm to isomorphism testing for graphs of small genus. This result is noteworthy for at least two reasons. First, this extends the polynomial time isomorphism results for the plane [HT 72] and also the projective plane [L 80] to arbitrary surfaces. Second, this gives one of the few known natural decompositions of the isomorphism problem into an infinite hierarchy of problems Po,P1,... such that isomorphism testing of problems in P1 is decidable in time vO(i).