A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

DOI10.1016/J.DAM.2009.12.007MaRDI QIDQ972325zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

dominating setHamiltonian graphpeer-to-peer systemmobile serverstransferability

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Network design and communication in computer systems (68M10)

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

Cites work

• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1354118 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• A Study on r-Configurations---A Resource Assignment Problem on Graphs
• Approximation algorithms for connected dominating sets
• Dominating sets in planar graphs
• Finding a minimum independent dominating set in a permutation graph
• Linear algorithm for domatic number problem on interval graphs
• On approximating the minimum independent dominating set
• On the domatic number of interval graphs
• The Domatic Number Problem in Interval Graphs
• The weighted perfect domination problem
• Towards a theory of domination in graphs

Cited in

(3)

• Transferable domination number of graphs
• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
• Algorithms and Computation

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)