|
|
|
Publications in Math-Net.Ru |
Citations |
|
2016 |
| 1. |
A. V. Prolubnikov, “Reduction of the graph isomorphism problem to checking the equality of polynomials of $n$ variables”, Trudy Inst. Mat. i Mekh. UrO RAN, 22:1 (2016), 235–240    |
|
2010 |
| 2. |
A. V. Prolubnikov, “On a new complete invariant for acyclic graphs”, Prikl. Diskr. Mat., 2010, no. supplement № 3, 97–98 |
|
2009 |
| 3. |
I. V. Shirokov, A. V. Prolubnikov, “Algorithms for the graph isomorphism problem based on graph deregularisation”, Prikl. Diskr. Mat., 2009, no. supplement № 1, 101–102 |
|
| Organisations |
|
|
Contact us: