scientific article; zbMATH DE number 2079336
From MaRDI portal
Publication:4471291
Recommendations
Cited in
(18)- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs
- Tree decompositions of graphs: saving memory in dynamic programming
- Kernels in planar digraphs
- A refined search tree technique for dominating set on planar graphs
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Genus characterizes the complexity of certain graph problems: Some tight results
- Graph minors and parameterized algorithm design
- New upper bounds on the decomposability of planar graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
- Fine-grained complexity of multiple domination and dominating patterns in sparse graphs
- Experiments on data reduction for optimal domination in networks
- Linearity of grid minors in treewidth with applications through bidimensionality
- Branchwidth of chordal graphs
- Dynamic programming and planarity: improved tree-decomposition based algorithms
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 Q4471291)
