Isomorphism testing and symmetric of graphs
暂无分享,去创建一个
[1] Rudolf Mathon,et al. A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..
[2] Z. Hedrlín,et al. On full embeddings of categories of algebras , 1966 .
[3] Derek G. Corneil,et al. The graph isomorphism disease , 1977, J. Graph Theory.
[4] Leonard M. Adleman,et al. Reducibility, randomness, and intractibility (Abstract) , 1977, STOC '77.
[5] Christoph M. Hoffmann. Testing isomorphism of cone graphs(Extended Abstract) , 1980, STOC '80.
[6] Anna Lubiw,et al. Some NP-Complete Problems Similar to Graph Isomorphism , 1981, SIAM J. Comput..
[7] Brendan D. McKay,et al. Computing automorphisms and canonical labellings of graphs , 1978 .
[8] Gary L. Miller. Graph Isomorphism, General Remarks , 1979, J. Comput. Syst. Sci..
[9] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[10] Volker Strassen,et al. A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..
[11] László Babai,et al. On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..
[12] Robert Frucht. Lattices with a given abstract group of automorphisms , 1950 .
[13] J. J. Seidel,et al. SYMMETRIC HADAMARD MATRICES OF ORDER 36 , 1970 .
[14] I. S. Filotti,et al. A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus , 1980, STOC '80.
[15] Gary L. Miller,et al. Isomorphism testing for graphs of bounded genus , 1980, STOC '80.
[16] M. Furst. A Subexponential Algorithm for Trivalent Graph Isomorphism , 1980 .
[17] François Lalonde. Le probleme d'etoiles pour graphes est np-complet , 1981, Discret. Math..
[18] László Babai,et al. Canonical labelling of graphs in linear average time , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[19] R. Frucht. Herstellung von Graphen mit vorgegebener abstrakter Gruppe , 1939 .