# Graph isomorphism

## Papers overview

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

Highly Cited

2015

Highly Cited

2015

- ArXiv
- 2015

We show that the Graph Isomorphism (GI) problem and its generalizations, the String Isomorphism (SI) and Coset Intersection (CI… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Transactions on Pattern Analysis and Machine…
- 2004

We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- 2001

Despite the significant number of isomorphism algorithms presented in the literature, till now no efforts have been done to… (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Lecture Notes in Computer Science
- 1982

Come with us to read a new book that is coming recently. Yeah, this is a new coming book that many people really want to read… (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- SIAM J. Comput.
- 1980

Abstract. A straightforward linear time canonical labeling algorithm is shown to apply to almost all graphs (i .e. all but o(2 (2… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- 1979

Abstract. We present an O(V 4 log V ) coin flipping algorithm to test vertex-colored graphs with bounded color multiplicities for… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- J. ACM
- 1979

A graph is an interval graph tf and only if each of Its verttces can be associated with an interval on the real hne m such a way… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Inf. Process. Lett.
- 1979

The objective of this note is to show that the problem of recognizing whether or not two graphs are isomorphic and the problem of… (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- J. ACM
- 1976

Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm… (More)

Is this relevant?

Highly Cited

1970

Highly Cited

1970

- J. ACM
- 1970

A procedure for de te rmining whe the r two graphs are isomorphic is described. During the procedure, from any given graph two… (More)

Is this relevant?