Name
Abstract | ||
|---|---|---|
We survey the modern theory of schemes (coherent configurations). The main attention is paid to the schurity problem and the separability problem. Several applications of schemes to constructing polynomial-time algorithms, in particular, graph isomorphism tests, are discussed. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ejc.2008.11.005 | Eur. J. Comb. |
Keywords | Field | DocType |
separability problem,association scheme,permutation group approach,coherent configuration,graph isomorphism test,polynomial-time algorithm,modern theory,main attention,schurity problem,permutation group,graph isomorphism | Graph canonization,Permutation graph,Discrete mathematics,Association scheme,Combinatorics,Graph property,Graph isomorphism,Algebra,Induced subgraph isomorphism problem,Cyclic permutation,Mathematics,Subgraph isomorphism problem | Journal |
Volume | Issue | ISSN |
30 | 6 | 0195-6698 |
Citations | PageRank | References |
13 | 2.23 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergei Evdokimov | 1 | 171 | 16.35 |
| Ilia N. Ponomarenko | 2 | 40 | 7.24 |