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
85136

Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks
Sergei Evdokimov, Ilia Ponomarenko
[Download PostScript] [Download PDF]

We show that the isomorphism test for $n$-vertex edge coloured graphs with the~multiplicity of Jordan blocks bounded by $k$ can be done in time $(e^{k^2}n)^{O(1)}$.

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