A linear algorithm for finding a minimum dominating set in a cactus.
Stephen T. HedetniemiRenu C. LaskarJohn PfaffPublished in: Discret. Appl. Math. (1986)
Keyphrases
- dominating set
- linear complexity
- dynamic programming
- learning algorithm
- detection algorithm
- np hard
- facility location problem
- expectation maximization
- segmentation algorithm
- cost function
- k means
- search space
- objective function
- neural network
- worst case
- mathematical model
- matching algorithm
- linear systems
- connected dominating set