Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

We report the current state of the graph isomorphism problem from the practical point of view. After describing the general…

Highly Cited

2010

Highly Cited

2010

We show that the quantum dynamics of interacting and noninteracting quantum particles are fundamentally different in the context…

Highly Cited

2008

Highly Cited

2008

We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The…

Highly Cited

2008

Highly Cited

2008

Canonical labeling of a graph consists of assigning a unique label to each vertex such that the labels are invariant under…

Highly Cited

2004

Highly Cited

2004

The isomorphism problem for circulant graphs (Cayley graphs over the cyclic group) which has been open since 1967 is completely…

Review

1996

Review

1996

The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The…

Highly Cited

1995

Highly Cited

1995

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are…

Highly Cited

1993

Highly Cited

1993

Introduction Preliminaries Decision Problems, Search Problems, and Counting Problems NP-Completeness The Classes P and NP…

Highly Cited

1993

Highly Cited

1993

This report documents the program and the outcomes of Dagstuhl Seminar 15511 “The Graph Isomorphism Problem”. The goal of the…

Highly Cited

1974

Highly Cited

1974

The isomorphism problem for graphs G1 and G2 is to determine if there exists a one-to-one mapping of the vertices of G1 onto the…