The k-neighbor domination problem
โ Scribed by Shiow-Fen Hwang; Gerard J. Chang
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 314 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality, so that the maximum distance of any node to its nearest center is minimized. In this paper, we consider a generalization of this prob
A configuration of queens on an m X m chessboard is said to dominate the board if every square either contains a queen or is attacked by a queen. The configuration is said to be non-attacking if no queen attacks another queen. Let f(m) and g(m) equal the minimum number of queens and the minimum numb