On the domatic number of interval graphs
Information Processing Letters
Finding a minimum independent dominating set in a permutation graph
Discrete Applied Mathematics
Linear algorithm for domatic number problem on interval graphs
Information Processing Letters
The domatic number problem interval graphs
SIAM Journal on Discrete Mathematics
The weighted perfect domination problem
Information Processing Letters
On approximating the minimum independent dominating set
Information Processing Letters
A Study on r-Configurations---A Resource Assignment Problem on Graphs
SIAM Journal on Discrete Mathematics
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
How to provide continuous services by mobile servers in communication networks
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
This paper studies a vertex domination problem in dynamic networks, which allows dynamic change of the set of vertices, the set of edges, and the set of weights. In particular, we will examine the following two theoretical issues arising in designing an adaptive vertex domination scheme for such networks: 1) How can we transfer a given configuration to a dominating configuration while keeping that any intermediate configuration is safe? 2) How can we reduce the computational complexity of the vertex domination problem by allowing defections in the domination?