More efficient periodic traversal in anonymous undirected graphs (Q442265): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2012.01.035
@@ Property / DOI: 10.1016/j.tcs.2012.01.035 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.01.035
+Normal rank
@@ Property / OpenAlex ID @@
+W2174851824
@@ Property / OpenAlex ID: W2174851824 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata and Labyrinths
@@ Property / cites work: Automata and Labyrinths / rank @@
+Normal rank
@@ Property / cites work @@
+Space Lower Bounds for Maze Threadability on Restricted Machines
+Normal rank
@@ Property / cites work @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Fast periodic graph exploration with constant memory
+Normal rank
@@ Property / cites work @@
+Setting port numbers for fast graph exploration
@@ Property / cites work: Setting port numbers for fast graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Decomposition for Improving Memoryless Periodic Exploration
+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 @@
+Automaten in planaren Graphen
@@ Property / cites work: Automaten in planaren Graphen / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2012.01.035
@@ Property / DOI: 10.1016/J.TCS.2012.01.035 / rank @@
+Normal rank