A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
DOI10.1016/J.DAM.2009.12.007zbMATH Open1205.68033OpenAlexW2053842969MaRDI QIDQ972325FDOQ972325
Authors: Satoshi Fujita 
Publication date: 25 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.007
Recommendations
- Algorithms and Computation
- Locating a Mobile Server Queueing Facility on a Tree Network
- Tight bound on mobile Byzantine agreement
- Distributed protocols for networks with mobile users -- the Mobilizer approach
- scientific article; zbMATH DE number 1256670
- scientific article; zbMATH DE number 3997523
- Enabling minimal dominating set in highly dynamic distributed systems
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On approximating the minimum independent dominating set
- Towards a theory of domination in graphs
- Finding a minimum independent dominating set in a permutation graph
- Title not available (Why is that?)
- The weighted perfect domination problem
- Approximation algorithms for connected dominating sets
- Dominating sets in planar graphs
- On the domatic number of interval graphs
- Linear algorithm for domatic number problem on interval graphs
- A Study on r-Configurations---A Resource Assignment Problem on Graphs
- The Domatic Number Problem in Interval Graphs
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972325)
