The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic. The problem is neither known to… (More)

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

Highly Cited

2014

Highly Cited

2014

- Brendan D. McKay, Adolfo Piperno
- J. Symb. Comput.
- 2014

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

Is this relevant?

2010

2010

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

Is this relevant?

2008

2008

- Shmuel Friedland
- ArXiv
- 2008

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

Is this relevant?

2008

2008

- Sébastien Sorlin, Christine Solnon
- Constraints
- 2008

We introduce a new filtering algorithm, called IDL(d)-filtering, for a global constraint dedicated to the graph isomorphism… (More)

Is this relevant?

Review

1996

Review

1996

- Scott Fortin
- 1996

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

Is this relevant?

1994

1994

- Ilia N. Ponomarenko
- Applicable Algebra in Engineering, Communication…
- 1994

We demonstrate a number of hard permutation group algorithmic problems, such as Group Intersection and Setwise Stabilizer, which… (More)

Is this relevant?

1994

1994

- Ilia N. Ponomarenko
- Applicable Algebra in Engineering, Communication…
- 1994

We consider the families of matrix algebras over C associated with graphs. Restricting the multiplicity of the irreducible… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Johannes Köbler, Uwe Schöning, Jacobo Torán
- Progress in Theoretical Computer Science
- 1993

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

Is this relevant?

1992

1992

- Antoni Lozano, Jacobo Torán
- Structure in Complexity Theory Conference
- 1992

We study the nonuniform complexity of the Graph Isomorphism (GI) and Graph Automorphism (GA) problems considering the… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Uwe Schöning
- STACS
- 1987

The problem of determining whether two given finite graphs are isomorphic is easily seen to belong to the class NP. But up to now… (More)

Is this relevant?