On tradeoffs between width- and fill-like graph parameters (Q1999998): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Q3113669
@@ Property / cites work: Q3113669 / rank @@
+Normal rank
@@ Property / cites work @@
+Connected graph searching
@@ Property / cites work: Connected graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+On interval graphs and matrice profiles
@@ Property / cites work: On interval graphs and matrice profiles / rank @@
+Normal rank
@@ Property / cites work @@
+Tree decompositions with small cost
@@ Property / cites work: Tree decompositions with small cost / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Q4218147
@@ Property / cites work: Q4218147 / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Time Algorithms for Finding Small Tree and Path Decompositions
+Normal rank
@@ Property / cites work @@
+Fugitive-search games on graphs and related parameters
+Normal rank
@@ Property / cites work @@
+From Pathwidth to Connected Pathwidth
@@ Property / cites work: From Pathwidth to Connected Pathwidth / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum cost edge searching
@@ Property / cites work: On minimum cost edge searching / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimum-length path decompositions
+Normal rank
@@ Property / cites work @@
+Graph Searching and Interval Completion
@@ Property / cites work: Graph Searching and Interval Completion / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching, elimination trees, and a generalization of bandwidth
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on guaranteed graph searching
+Normal rank
@@ Property / cites work @@
+Connected Treewidth and Connected Graph Searching
@@ Property / cites work: Connected Treewidth and Connected Graph Searching / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Tridiagonalization by permutations
@@ Property / cites work: Tridiagonalization by permutations / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of subgraph isomorphism for classes of partial k-trees
+Normal rank
@@ Property / cites work @@
+Embeddings of \(k\)-connected graphs of pathwidth \(k\)
+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 @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Interval graphs and searching
@@ Property / cites work: Interval graphs and searching / rank @@
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4246749
@@ Property / cites work: Q4246749 / 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 @@
+Black-white pebbles and graph separation
@@ Property / cites work: Black-white pebbles and graph separation / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum size tree-decompositions
@@ Property / cites work: Minimum size tree-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3477966
@@ Property / cites work: Q3477966 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Complete Register Allocation Problems
@@ Property / cites work: Complete Register Allocation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+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
@@ Property / cites work @@
+Q4246051
@@ Property / cites work: Q4246051 / rank @@
+Normal rank