Computing branchwidth via efficient triangulations and blocks (Q967315): Difference between revisions

@@ Property / cites work @@
+Satisfiability, branch-width and Tseitin tautologies
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+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 @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Enumerating maximal independent sets with applications to graph colouring.
+Normal rank
@@ Property / cites work @@
+Tour Merging via Branch-Decomposition
@@ Property / cites work: Tour Merging via Branch-Decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Measure and conquer
@@ Property / cites work: Measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
+Normal rank
@@ Property / cites work @@
+New upper bounds on the decomposability of planar graphs
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501274
@@ Property / cites work: Q5501274 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Computing the branchwidth of interval graphs
@@ Property / cites work: Computing the branchwidth of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Branch-Width of Circular-Arc Graphs
@@ Property / cites work: The Branch-Width of Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations and algorithmic applications of chordal graph embeddings
+Normal rank
@@ Property / cites work @@
+An improved exponential-time algorithm for             <i>k</i>             -SAT
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/dam/FominMT09
@@ Property / DBLP publication ID: journals/dam/FominMT09 / rank @@
+Normal rank