Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 1995 Copyright 1995 University of Bonn, Department of Computer Science, Abt. V
85137

On a New High Dimensional Weisfeiler-Lehman Algorithm
Sergei Evdokimov, Marek Karpinski, Ilia Ponomarenko
[Download PostScript] [Download PDF]

In the paper we define and study a generalization of the Weisfeiler-Lehman algo which constructs the cellular closure of a set of matrices. The new technique The underlying construction gives a new sufficient condition for a cellular algebra to be Schurian.

Last Change: 08/18/99 at 13:00:38
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V