Algorithms for the graph isomorphism problem based on graph deregularisation
Download file
Counter downloads: 316
Keywords
Authors
| Name | Organization | |
| Shirokov I. V. | Omsk State Technical University | iv_shirokov@mail.ru |
| Prolubnikov A. V. | Omsk State University | a.v.prolubnikov@mail.ru |
References
Faizullin R. T., Prolubnikov A. V. An algorithm of the spectral splitting for the double permutation cipher / / Recognition and Image Analysis. MAIK, Nauka. 2002. V. 12. No. 4. P. 310-324.
Пролубников А. В., Файзуллин Р. Т. Построение защищенного видеоканала с использованием изоморфизма графов / / Вестник Томского госуниверситета. Приложение. №9(1). 2004. С. 71-74.
Foggia P., Sansone C., Vento M. A Database of graphs for isomorphism and sub-graph isomorphism benchmarking / / Proc. of the 3rd IAPR TC-15 international workshop on graphbased representations, Italy, 2001. P. 157-168.
Miyazaki T. The complexity of McKay's canonical labeling algorithm / / Groups and Computation, II. Amer. Math. Soc., Providence, RI, 1997. P. 239-256.
http://www.maths.gla.ac.uk/~es - Strongly Regular Graphs.
