Graph isomorphism, general remarks

By Gary L. Miller. 1977

Subfields: Graph Learning, Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Graph Learning

1. Takunari Miyazaki
2. B. Douglas

In Algorithms & Complexity

1. B. Douglas
2. Takunari Miyazaki
3. Petteri Kaski
4. Tommi A. Junttila

Citations in the corpus

• The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, background): “ctical importance and its relationship to questions of computational complexity. Examples of excellent references articles providing a more thorough background to the GI problem can be found in [32], [25] and [29]. The exact complexity status of the graph isomorphism (GI) problem remains unknown. It”
• The complexity of McKay's canonical labeling algorithm (1995, background): “Since all such structures can be canonically represented by graphs in polynomial time [10], [19], it suffices to solve the problem for graphs (cf. [2]).”