Coherent algebras and the graph isomorphism problem
By Shmuel Friedland. 1989
Subfields: 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 Algorithms & Complexity
Citations in the corpus
- The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, methodology): “For a more thorough background to coherent configurations and their relation to the WL method, see [12, 16, 15, 9].”
- On Highly Closed Cellular Algebras and Highly Closed Isomorphisms (1998, background): “The following statement is straightforward from the de nitions (see also [8]).”