Practical algorithms on partial k-trees with an application to domination-like problems
From MaRDI portal
Recommendations
Cites work
- Algorithms finding tree-decompositions of graphs
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Characterization and Recognition of Partial 3-Trees
- Easy problems for tree-decomposable graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graph theory with applications
- scientific article; zbMATH DE number 4174333 (Why is no real title available?)
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear-time computability of combinatorial problems on series-parallel graphs
- Linear-time computation of optimal subgraphs of decomposable graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(31)- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Algorithms for generalized vertex-rankings of partial k-trees
- Perfect edge domination and efficient edge domination in graphs
- Polynomial time algorithms for variants of graph matching on partial k-trees
- Convex dominating sets in maximal outerplanar graphs
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Tree decompositions of graphs: saving memory in dynamic programming
- New branch-and-bound algorithms for k-cardinality tree problems
- scientific article; zbMATH DE number 2086260 (Why is no real title available?)
- An asymptotic analysis of labeled and unlabeled k-trees
- Restrained and total restrained domination in graphs
- Automated bounds on recursive structures
- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
- scientific article; zbMATH DE number 4024784 (Why is no real title available?)
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- Vertex partitioning problems on partial k-trees
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Optimal dynamic program for r-domination problems over tree decompositions
- Seeing Arboretum for the (partial k-) Trees
- Fast Algorithms for Join Operations on Tree Decompositions
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- Graph limits of random graphs from a subset of connected k-trees
- Finding edge-disjoint paths in partial k-trees
- Composing dynamic programming tree-decomposition-based algorithms
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
- Title not available (Why is no real title available?)
- Exact algorithms and applications for tree-like Weighted Set Cover
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
This page was built for publication: Practical algorithms on partial k-trees with an application to domination-like problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060153)
