Unbounded search and recursive graph problems (Q5096341): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-59175-3_99
+Normal rank
@@ Property / OpenAlex ID @@
+W1771707026
@@ Property / OpenAlex ID: W1771707026 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective coloration
@@ Property / cites work: Effective coloration / rank @@
+Normal rank
@@ Property / cites work @@
+Unbounded Searching Algorithms
@@ Property / cites work: Unbounded Searching Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
+Normal rank
@@ Property / cites work @@
+On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
+Normal rank
@@ Property / cites work @@
+Terse, superterse, and verbose sets
@@ Property / cites work: Terse, superterse, and verbose sets / rank @@
+Normal rank
@@ Property / cites work @@
+An almost optimal algorithm for unbounded searching
+Normal rank
@@ Property / cites work @@
+Q5595624
@@ Property / cites work: Q5595624 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian paths in infinite graphs
@@ Property / cites work: Hamiltonian paths in infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Effective Matchmaking and k-Chromatic Graphs
@@ Property / cites work: Effective Matchmaking and k-Chromatic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank