On Complexities of Minus Domination
From MaRDI portal
Publication:2867118
DOI10.1007/978-3-319-03780-6_16zbMath1406.68038arXiv1307.6663OpenAlexW1522787208MaRDI QIDQ2867118
Yue-Li Wang, Hsiang-Hsuan Liu, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon, Luérbio Faria
Publication date: 10 December 2013
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6663
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Algorithmic Aspect of Minus Domination on Small-Degree Graphs ⋮ Algorithms and Hardness for Signed Domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination, independent domination, and duality in strongly chordal graphs
- Variations of \(Y\)-dominating functions on graphs
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Treewidth. Computations and approximations
- Algorithmic aspects of majority domination
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- The extremal function for complete minors
- The algorithmic complexity of minus domination in graphs
- Signed and Minus Domination in Complete Multipartite Graphs
- FPT Results for Signed Domination
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
- Totally-Balanced and Greedy Matrices
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Kernelization and Lower Bounds of the Signed Domination Problem
- Minus domination in small-degree graphs
- Lower bound on the minus-domination number
This page was built for publication: On Complexities of Minus Domination
