Pathwidth is NP-Hard for Weighted Trees (Q5321709): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02270-8_20
+Normal rank
@@ Property / OpenAlex ID @@
+W1883847458
@@ Property / OpenAlex ID: W1883847458 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotonicity in graph searching
@@ Property / cites work: Monotonicity in graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth of Permutation Graphs
@@ Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Node-searching problem on block graphs
@@ Property / cites work: Node-searching problem on block graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the vertex separation of unicyclic graphs
+Normal rank
@@ Property / cites work @@
+The vertex separation and search number of a graph
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4430892
@@ Property / cites work: Q4430892 / 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 @@
+Characterizing Minimal Interval Completions
@@ Property / cites work: Characterizing Minimal Interval Completions / 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 @@
+TREEWIDTH OF CIRCLE GRAPHS
@@ Property / cites work: TREEWIDTH OF CIRCLE GRAPHS / 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 @@
+Pathwidth is NP-Hard for Weighted Trees
@@ Property / cites work: Pathwidth is NP-Hard for Weighted Trees / 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 @@
+Connected graph searching in chordal graphs
@@ Property / cites work: Connected graph searching in chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3208679
@@ Property / cites work: Q3208679 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4159394
@@ Property / cites work: Q4159394 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge and node searching problems on trees
@@ Property / cites work: Edge and node searching problems on trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the Treewidth and Pathwidth of Biconvex Bipartite 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
@@ Property / cites work @@
+Pathwidth of Circular-Arc Graphs
@@ Property / cites work: Pathwidth of Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth of Circular-Arc Graphs
@@ Property / cites work: Treewidth of Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank