Chessboard domination on programmable graphics hardware
Abstract
References
Index Terms
- Chessboard domination on programmable graphics hardware
Recommendations
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
Let G=(V,E) be a graph. A set S@__ __V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V-S is adjacent to a vertex in V-S. A set S@__ __V is a restrained dominating set if every vertex in V-S is ...
The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs
Computing and CombinatoricsAbstractLet G be a graph with vertex set V(G) and edge set E(G). A set is a dominating set of G if every vertex not in D is adjacent to at least one vertex of D. A restrained dominating set of G is a dominating set S such that every vertex not in S ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 247Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in