Practical graph isomorphism, II
作者： Brendan D. McKay , Adolfo Piperno
DOI: 10.1016/J.JSC.2013.09.003
关键词:
摘要: … report the current state of the graph isomorphism problem from the practical point of view. After describing the general principles of the … For nauty we used the dense or sparse version …
arxiv.org
acm.org
core.ac.uk
elsevier.com
sci-hub.se 参考文章(29)
William Kocay, On Writing Isomorphism Programs Computational and Constructive Design Theory. pp. 135- 175 ,(1996) , 10.1007/978-1-4757-2497-4_6
P. Foggia, M. Vento, C.Sansone, A Performance Comparison of Five Algorithms for Graph Isomorphism ,(2001)
Tommi Junttila, Petteri Kaski, Engineering an efficient canonical labeling tool for large and sparse graphs algorithm engineering and experimentation. pp. 135- 149 ,(2007)
Brendan D. McKay, Computing automorphisms and canonical labellings of graphs Springer, Berlin, Heidelberg. pp. 223- 232 ,(1978) , 10.1007/BFB0062536
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Tommi Junttila, Petteri Kaski, Conflict Propagation and Component Recursion for Canonical Labeling Theory and Practice of Algorithms in (Computer) Systems. ,vol. 6595, pp. 151- 162 ,(2011) , 10.1007/978-3-642-19754-3_16
Antonio Fernández Anta, José Luis López-Presa, Luis Núñez Chiroque, Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation arXiv: Data Structures and Algorithms. ,(2011)
Martin Grohe, Structural and logical approaches to the graph isomorphism problem symposium on discrete algorithms. pp. 188- 188 ,(2012) , 10.5555/2095116.2095132
Eugene M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time Journal of Computer and System Sciences. ,vol. 25, pp. 42- 65 ,(1982) , 10.1016/0022-0000(82)90009-5