The diversity of domination

Authors:
Michael A. Henning;Ortrud R. Oellermann;Henda C. Swart
Affiliations:
-;-;-
Venue:
Discrete Mathematics
Year:
1996

Citing 0
Cited 3

A solution for the location problem in arbitrary computer networks using generic dominating sets

Proceedings of the 2005 ACM symposium on Applied computing
Approximating the Spanning k-Tree Forest Problem

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.07

Visualization

Abstract