scientific article; zbMATH DE number 2086260
zbMATH Open1059.68598MaRDI QIDQ3044360FDOQ3044360
Authors: Jochen Alber, Rolf Niedermeier 
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2286/22860613.htm
Title of this publication is not available (Why is that?)
Recommendations
- Practical algorithms on partial k-trees with an application to domination-like problems
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Faster algorithms on branch and clique decompositions
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (28)
- Graphs, branchwidth, and tangles! Oh my!
- Weighted maximum-clique transversal sets of graphs
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
- Courcelle's theorem -- a game-theoretic approach
- Graph minors and parameterized algorithm design
- Dual parameterization and parameterized approximability of subset graph problems
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Optimal dynamic program for \(r\)-domination problems over tree decompositions
- Tree-decompositions of small pathwidth
- Practical algorithms on partial k-trees with an application to domination-like problems
- On the \(k\)-rainbow domination in graphs with bounded tree-width
- Branch decompositions and minor containment
- Tree decompositions of graphs: saving memory in dynamic programming
- Improved algorithms and complexity results for power domination in graphs
- The parameterized complexity of the induced matching problem
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Counting Maximal Independent Sets in Subcubic Graphs
- Title not available (Why is that?)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Star partitions on graphs
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- On independent sets and bicliques in graphs
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044360)
