On Highly Closed Cellular Algebras and Highly Closed Isomorphisms

By Sergei Evdokimov, Ilia N. Ponomarenko. 1998

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

1. B. Douglas
2. Jamie Smith

Citations in the corpus

• The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, methodology): “Properties of the ‘k-equivalent’ graph families constructed in Cai, Fürer and Immerman [10] and Evdokimov and Ponomarenko [15] are analysed relative the the recursive k-dim WL method.”
• k-Boson Quantum Walks Do Not Distinguish Arbitrary Graphs (2010, background): “The existence of k-equivalent graphs for any positive integer k is proven in [2] and [6].”