Pages that link to "Item:Q5248490"

The following pages link to A linear time algorithm for finding tree-decompositions of small treewidth (Q5248490):

Displaying 50 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• The density maximization problem in graphs (Q386420) (← links)
• On graph contractions and induced minors (Q415282) (← links)
• Decomposition width of matroids (Q415290) (← links)
• DAG-based attack and defense modeling: don't miss the forest for the attack trees (Q473215) (← links)
• Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
• Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
• A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
• Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
• The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
• A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
• On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
• An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
• Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
• \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
• The complexity of induced minors and related problems (Q1346772) (← links)
• Generalized coloring for tree-like graphs (Q1363645) (← links)
• Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
• On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
• Channel assignment on graphs of bounded treewidth (Q1417576) (← links)
• Conjunctive query containment revisited (Q1575132) (← links)
• Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
• Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
• Secluded connectivity problems (Q1679225) (← links)
• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
• Tractability of most probable explanations in multidimensional Bayesian network classifiers (Q1726375) (← links)
• Max NP-completeness made easy (Q1960655) (← links)
• Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
• Recoloring graphs of treewidth 2 (Q2231701) (← links)
• Learning tractable Bayesian networks in the space of elimination orders (Q2321308) (← links)
• Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• Evaluating interval-valued influence diagrams (Q2374538) (← links)
• Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
• Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
• A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
• Parameterized Complexity of Discrete Morse Theory (Q2828168) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
• Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
• (Q3386630) (← links)
• Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs (Q3438981) (← links)
• Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
• Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211) (← links)
• How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
• Shortest path queries in digraphs of small treewidth (Q4645182) (← links)
• Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
• Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results (Q4845143) (← links)
• Generalized dominators for structured programs (Q5030185) (← links)