Name
Abstract | ||
|---|---|---|
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)}$. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/s004930050059 | Combinatorica |
Keywords | Field | DocType |
coloured graphs,coloured graph,jordan blocks,isomorphism test,vertex edge | Discrete mathematics,Graph,Combinatorics,Multiplicity (mathematics),Isomorphism,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
19 | 3 | 0209-9683 |
Citations | PageRank | References |
13 | 0.69 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergei Evdokimov | 1 | 171 | 16.35 |
| Ilia N. Ponomarenko | 2 | 40 | 7.24 |