๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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 p-neighbor k-center problem
โœ Shiva Chaudhuri; Naveen Garg; R. Ravi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 389 KB

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

The weighted perfect domination problem
โœ Chain-Chin Yen; R.C.T. Lee ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 393 KB
On the queen domination problem
โœ Charles M. Grinstead; Bruce Hahne; David Van Stone ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 393 KB

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

The problem with neighbors
โœ Gary W. Paquin; Eileen Gambrill ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 840 KB