(Total) vector domination for graphs with bounded branchwidth
From MaRDI portal
Publication:290105
DOI10.1016/J.DAM.2016.03.002zbMATH Open1337.05082OpenAlexW2336746553MaRDI QIDQ290105FDOQ290105
Authors: Toshimasa Ishii, Hirotaka Ono, Yushi Uno 
Publication date: 1 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.002
Recommendations
- (Total) vector domination for graphs with bounded branchwidth
- Subexponential fixed-parameter algorithms for partial vector domination
- Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
- Subexponential fixed-parameter algorithms for partial vector domination
- On the approximability and exact algorithms for vector domination and related problems in graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph minors. X: Obstructions to tree-decomposition
- Call routing and the ratcatcher
- Which problems have strongly exponential complexity?
- Graph minors. XIII: The disjoint paths problem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- On the Relationship Between Clique-Width and Treewidth
- Latency-bounded target set selection in social networks
- On the existence of subexponential parameterized algorithms
- Subexponential algorithms for partial cover problems
- On the approximability and exact algorithms for vector domination and related problems in graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Algorithmic construction of sets for k -restrictions
- Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- On the hardness of approximating minimization problems
- Title not available (Why is that?)
- Constructive linear time algorithms for branchwidth
- On Dominating Sets and Independent Sets of Graphs
- Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
- Dynamic Programming and Fast Matrix Multiplication
- Parameterized Algorithms for Generalized Domination
- Implicit branching and parameterized partial cover problems
- On bounded-degree vertex deletion parameterized by treewidth
Cited In (7)
- Subexponential fixed-parameter algorithms for partial vector domination
- Subexponential fixed-parameter algorithms for partial vector domination
- Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
- On the approximability and exact algorithms for vector domination and related problems in graphs
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Domination and convexity problems in the target set selection model
- (Total) vector domination for graphs with bounded branchwidth
This page was built for publication: (Total) vector domination for graphs with bounded branchwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290105)
