Strong-mixed searching and pathwidth (Q867027): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-9013-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2059837177
@@ Property / OpenAlex ID: W2059837177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3418339
@@ Property / cites work: Q3418339 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotonicity in graph searching
@@ Property / cites work: Monotonicity in graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+Eavesdropping games
@@ Property / cites work: Eavesdropping games / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Recontamination does not help to search a graph
@@ Property / cites work: Recontamination does not help to search a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed searching and proper-path-width
@@ Property / cites work: Mixed searching and proper-path-width / rank @@
+Normal rank