A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding a minimum independent dominating set in a permutation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domatic number of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study on <i>r</i>-Configurations---A Resource Assignment Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the minimum independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Domatic Number Problem in Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for domatic number problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted perfect domination problem / rank
 
Normal rank

Revision as of 20:16, 2 July 2024

scientific article
Language Label Description Also known as
English
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
scientific article

    Statements

    A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (English)
    0 references
    0 references
    25 May 2010
    0 references
    peer-to-peer system
    0 references
    mobile servers
    0 references
    dominating set
    0 references
    transferability
    0 references
    Hamiltonian graph
    0 references

    Identifiers