Pages that link to "Item:Q5060153"
From MaRDI portal
The following pages link to Practical algorithms on partial k-trees with an application to domination-like problems (Q5060153):
Displaying 18 items.
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees (Q4377448) (← links)
- (Q5136270) (← links)
- Graph limits of random graphs from a subset of connected <i>k</i>‐trees (Q5236927) (← links)
- Finding edge-disjoint paths in partial k-trees (Q6487440) (← links)
