Pages that link to "Item:Q1062758"

The following pages link to Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758):

Displaying 49 items.

• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
• Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
• The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
• Triangulating graphs without asteroidal triples (Q1917255) (← links)
• A decomposition algorithm for network reliability evaluation (Q1917266) (← links)
• Algebraic approach to fasciagraphs and rotagraphs (Q1917348) (← links)
• Connectivity of the graph induced by contractible edges of a \(k\)-tree (Q2010717) (← links)
• New limits of treewidth-based tractability in optimization (Q2118087) (← links)
• How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
• The basic algorithm for pseudo-Boolean programming revisited (Q2277139) (← links)
• Comparing linear width parameters for directed graphs (Q2322714) (← links)
• Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
• Tree-decompositions with bags of small diameter (Q2370441) (← links)
• A logical approach to efficient Max-SAT solving (Q2389619) (← links)
• Locating a robber with multiple probes (Q2411615) (← links)
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
• On permuted super-secondary structures of transmembrane \(\beta\)-barrel proteins (Q2453172) (← links)
• Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering (Q2457595) (← links)
• Unifying tree decompositions for reasoning in graphical models (Q2457660) (← links)
• Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
• Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Boxicity and treewidth (Q2642011) (← links)
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
• On the Tree-Width of Planar Graphs (Q2851524) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
• On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
• Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
• Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595) (← links)
• Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
• Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• Shortest path queries in digraphs of small treewidth (Q4645182) (← links)
• The pathwidth and treewidth of cographs (Q5056112) (← links)
• Canonical representations of partial 2-and 3-trees (Q5056113) (← links)
• Decomposability helps for deciding logics of knowledge and belief (Q5096273) (← links)
• Two strikes against perfect phylogeny (Q5204323) (← links)
• Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited (Q5229963) (← links)
• Graph limits of random graphs from a subset of connected <i>k</i>‐trees (Q5236927) (← links)
• Dynamic programming for graphs on surfaces (Q5501962) (← links)
• On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
• A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778) (← links)
• Topological parameters for time-space tradeoff (Q5940780) (← links)
• The firebreak problem (Q6065343) (← links)
• Tangle bases: Revisited (Q6087071) (← links)
• (Q6089685) (← links)