Coherent algebras and the graph isomorphism problem
Discrete Applied Mathematics - Combinatorics and complexity
Automorphism groups, isomorphism, reconstruction
Handbook of combinatorics (vol. 2)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Permutation group approach to association schemes
European Journal of Combinatorics
On p-covalenced association schemes
Journal of Combinatorial Theory Series A
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The Graph Isomorphism Problem and approximate categories
Journal of Symbolic Computation
| Hi-index | 0.00 |
We investigate the following problem: how differentcan a cellular algebra be from its Schurian closure, i.e.,the centralizer algebra of its automorphism group? For thispurpose we introduce the notion of a Schurian polynomial approximationscheme measuring this difference. Some natural examples of such schemesarise from high dimensional generalizations of the Weisfeiler-Lehmanalgorithm which constructs the cellular closure of a set of matrices.We prove that all of these schemes are dominated by a newSchurian polynomial approximation scheme defined bythe m-closure operators. A sufficient condition for the m-closureof a cellular algebra to coincide with its Schurian closure is given.