Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.01.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2057674369
@@ Property / OpenAlex ID: W2057674369 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on decision versus search for graph automorphism
+Normal rank
@@ Property / cites work @@
+Graph Isomorphism is in SPP
@@ Property / cites work: Graph Isomorphism is in SPP / rank @@
+Normal rank
@@ Property / cites work @@
+Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
+Normal rank
@@ Property / cites work @@
+Q4273947
@@ Property / cites work: Q4273947 / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-Complete Problems Similar to Graph Isomorphism
+Normal rank
@@ Property / cites work @@
+A note on the graph isomorphism counting problem
@@ Property / cites work: A note on the graph isomorphism counting problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computing graph automorphism from partial solutions
+Normal rank
@@ Property / cites work @@
+On the Hardness of Graph Isomorphism
@@ Property / cites work: On the Hardness of Graph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+The graph isomorphism disease
@@ Property / cites work: The graph isomorphism disease / rank @@
+Normal rank