Minimizing Congestion for Balanced Dominators
Abstract
Supplemental Material
- Download
- 228.37 MB
References
Index Terms
- Minimizing Congestion for Balanced Dominators
Recommendations
Locating-dominating sets in twin-free graphs
A locating-dominating set of a graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D ; that is, for distinct vertices u and v outside D , N ( u ) D N ( v ) D where N ( u ) ...
Finding outer-connected dominating sets in interval graphs
The outer-connected domination problem is abbreviated as the OCD problem.The OCD problem was known to be linear-time solvable on proper interval graphs.We solve the OCD problem on interval graphs in linear-time.We do so by developing a chainless ...
Partitioning of a graph into induced subgraphs not containing prescribed cliques
AbstractLet K p be a complete graph of order p ≥ 2. A K p-free k-coloring of a graph H is a partition of V ( H ) into V 1 , V 2 … , V k such that H [ V i ] does not contain K p for each i ≤ k. In 1977 Borodin and Kostochka conjectured that any graph H ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 249Total Downloads
- Downloads (Last 12 months)75
- Downloads (Last 6 weeks)13
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in