Exclusive graph searching vs. pathwidth (Q729824): Difference between revisions

@@ Property / cites work @@
+Approximating MIN 2-SAT and MIN 3-SAT
@@ Property / cites work: Approximating MIN 2-SAT and MIN 3-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Exclusive Graph Searching
@@ Property / cites work: Exclusive Graph Searching / rank @@
+Normal rank
@@ Property / cites work @@
+Connected graph searching
@@ Property / cites work: Connected graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Monotonicity in graph searching
@@ Property / cites work: Monotonicity in graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+A distributed algorithm for computing the node search number in trees
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed search number and linear-width of interval and split graphs
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on guaranteed graph searching
+Normal rank
@@ Property / cites work @@
+Edge search number of cographs
@@ Property / cites work: Edge search number of cographs / rank @@
+Normal rank
@@ Property / cites work @@
+On the pathwidth of chordal graphs
@@ Property / cites work: On the pathwidth of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed Search Number of Permutation Graphs
@@ Property / cites work: Mixed Search Number of Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / 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 @@
+Min Cut is NP-complete for edge weighted trees
@@ Property / cites work: Min Cut is NP-complete for edge weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4159394
@@ Property / cites work: Q4159394 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching on some subclasses of chordal graphs
+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 @@
+Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
+Normal rank