Abstract
We show that the isomorphism test for n-vertex edge coloured graphs with multiplicity of Jordan blocks bounded by k can be done in time (kkn)O(1).
Cite
CITATION STYLE
APA
Evdokimov, S., & Ponomarenko, I. (1999). Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks. Combinatorica, 19(3), 321–333. https://doi.org/10.1007/s004930050059
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free