Tree decomposition and discrete optimization problems: a survey
From MaRDI portal
Publication:2480502
Recommendations
- Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
- scientific article; zbMATH DE number 5158614
- scientific article; zbMATH DE number 3914115
- scientific article; zbMATH DE number 4059125
- scientific article; zbMATH DE number 4123532
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- scientific article; zbMATH DE number 20617
- Computing Optimal Hypertree Decompositions
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
Cites work
- A characterisation of rigid circuit graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- A linear time algorithm to compute a dominating path in an AT-free graph
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A New Lower Bound for Tree-Width Using Maximum Cardinality Search
- A practical algorithm for making filled graphs minimal
- A simple linear time LexBFS cograph recognition algorithm.
- A vertex incremental approach for maintaining chordality
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Algorithms – ESA 2004
- Automata, Languages and Programming
- Characterization and Recognition of Partial 3-Trees
- Chordal embeddings of planar graphs
- Complexity of Finding Embeddings in a k-Tree
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Computing the Minimum Fill-In is NP-Complete
- Counting clique trees and computing perfect elimination schemes in parallel
- Deterministic Dcomposition of Recursive Graph Classes
- Easy problems for tree-decomposable graphs
- Experimental and Efficient Algorithms
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Heuristic and metaheuristic methods for computing graph treewidth
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4149896 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 4024784 (Why is no real title available?)
- scientific article; zbMATH DE number 4095510 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- scientific article; zbMATH DE number 46669 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1107728 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1947421 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 1982177 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Incidence matrices and interval graphs
- Maximum cardinality search for computing minimal triangulations of graphs
- Monadic second-order evaluations on tree-decomposable graphs
- On nonserial modification of a local algorithm for the decomposition of discrete optimization problems
- On rigid circuit graphs
- On simple characterizations of k-trees
- On the Desirability of Acyclic Database Schemes
- On the tree representation of chordal graphs
- On treewidth approximations.
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- Power of Natural Semijoins
- Principles and Practice of Constraint Programming – CP 2004
- Representation of a finite graph by a set of intervals on the real line
- Representations of chordal graphs as subtrees of a tree
- Safe separators for treewidth
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Solving partial constraint satisfaction problems with tree decomposition
- Steiner trees, partial 2–trees, and minimum IFI networks
- The elimination form of the inverse and its application to linear programming
- The ellipsoid method and its consequences in combinatorial optimization
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The Use of Linear Graphs in Gauss Elimination
- Tour merging via branch-decomposition
- Treewidth: computational experiments
Cited in
(7)- Numerical analysis of tricriteria tree and assignment problems
- Tree-sparse convex programs
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- scientific article; zbMATH DE number 5158614 (Why is no real title available?)
- scientific article; zbMATH DE number 4059125 (Why is no real title available?)
- scientific article; zbMATH DE number 6862107 (Why is no real title available?)
- Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
This page was built for publication: Tree decomposition and discrete optimization problems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480502)
