The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2019136393
@@ Property / OpenAlex ID: W2019136393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501524
@@ Property / cites work: Q4501524 / rank @@
+Normal rank
@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+A Logspace Algorithm for Partial 2-Tree Canonization
+Normal rank
@@ Property / cites work @@
+Directed Planar Reachability Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Testing Graph Isomorphism in Parallel by Playing a Game
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4148000
@@ Property / cites work: Q4148000 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Completeness results for graph isomorphism.
@@ Property / cites work: Completeness results for graph isomorphism. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273947
@@ Property / cites work: Q4273947 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal traversal sequences with backtracking.
@@ Property / cites work: Universal traversal sequences with backtracking. / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm and Experiments in Testing Planar Graphs for Isomorphism
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+Parallel Tree Contraction Part 2: Further Applications
+Normal rank
@@ Property / cites work @@
+Q4234059
@@ Property / cites work: Q4234059 / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity testing in parallel
@@ Property / cites work: Planarity testing in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected ST-connectivity in log-space
@@ Property / cites work: Undirected ST-connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Making Nondeterminism Unambiguous
@@ Property / cites work: Making Nondeterminism Unambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+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 @@
+Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
+Normal rank
@@ Property / cites work @@
+Hardness Results for Tournament Isomorphism and Automorphism
+Normal rank
@@ Property / cites work @@
+A Set of Topological Invariants for Graphs
@@ Property / cites work: A Set of Topological Invariants for Graphs / rank @@
+Normal rank