Characterization and recognition of partial 3-trees
SIAM Journal on Algebraic and Discrete Methods
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Counting clique trees and computing perfect elimination schemes in parallel
Information Processing Letters
A fast algorithm for reordering sparse matrices for parallel factorization
SIAM Journal on Scientific and Statistical Computing
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Journal of Algorithms
Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Deterministic decomposition of recursive graph classes
SIAM Journal on Discrete Mathematics
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
A linear time algorithm to compute a dominating path in an AT-free graph
Information Processing Letters
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
A practical algorithm for making filled graphs minimal
Theoretical Computer Science
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms
Statistics and Computing
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Efficient Approximation for Triangulation of Minimum Treewidth
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Pre-processing for Triangulation of Probabilistic Networks
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
On Domination Elimination Orderings and Domination Graphs (Extended Abstract)
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Minimal Elimination Ordering Inside a Given Chordal Graph
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Implementation of a Minimal Triangulation Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A New Lower Bound for Tree-Width Using Maximum Cardinality Search
SIAM Journal on Discrete Mathematics
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Cliques and Their Separators in Triangulated Graphs
Cliques and Their Separators in Triangulated Graphs
Linear algorithms on k-terminal graphs
Linear algorithms on k-terminal graphs
Tour Merging via Branch-Decomposition
INFORMS Journal on Computing
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing Minimal Triangulations in Time O(n\alpha \log n) = o(n2.376)
SIAM Journal on Discrete Mathematics
New lower and upper bounds for graph treewidth
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A practical algorithm for finding optimal triangulations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Block Local Elimination Algorithms for Sparse Discrete Optimization Problems
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
The paper considers tree decomposition methods as applied to discrete optimization and presents relevant mathematical results.