Documents Related by Co-Citation

119 An Optimal Lower Bound on the Number of Variables for Graph Identification – Jin-yi Cai, Neil Immerman, Martin Fürer - 1992
56 Canonical labeling of graphs – Laszlo Babai, Eugene M Luks - 1983
49 Graph isomorphism is in the low hierarchy – U Schöning - 1988
14 Parallel algorithms for permutation groups and graph isomorphism – E M Luks - 1986
21 Isomorphism of bounded valence can be tested in polynomial time – E Luks - 1982
31 Moderately exponential bound for graph isomorphism, in Fundamentals of computation theory – L Babai - 1981
101 Does co-NP have short interactive proofs – Ravi B Boppana, Johan H˚astad, Stathis Zachos - 1987
280 Arthur–Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes – L Babai, S Moran - 1988
36 A note on the graph isomorphism counting problem – R Mathon - 1979
55 The graph isomorphism problem: Its structural complexity, Birkhauser Boston – Johannes Köbler, Uwe Schöning, Jacobo Torán - 1993
7 A Note on the Hardness of Tree Isomorphism – Birgit Jenner, Pierre McKenzie, Jacobo Torán - 1997
121 Undirected ST-connectivity in log-space – Omer Reingold - 2005
26 Polynomial time algorithms for permutation groups – M L Furst, J Hopcroft, E M Luks - 1980
20 Parallel Tree Contraction Part 2: Further Applications – Gary L. Miller, John H. Reif - 1991
13 Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization – Samuel R. Buss - 1997
16 A logspace algorithm for tree canonization – Steven Lindell - 1992
192 A taxonomy of problems with fast parallel algorithms – S Cook - 1985
11 Completeness results for Graph Isomorphism – Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán - 2002
115 Isomorphism of graphs of bounded valence can be tested in polynomial time – Eugene M Luks - 1982