Self-stabilizing algorithms for the dominating set
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
... 1.2. Self-stabilization with safe convergence Fault-tolerant systems are classified into two categories: masking and non-masking ...non-masking. Self-stabilization [3] is a theoretical framework of ...
11
A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks
... influence dominating set ...is stabilizing it always finds a minimal posi- tive influence dominating set ...pointer set P (i) makes a finite number of moves since it only use the ...
7
Algorithms for Finding an Efficient Dominating Set of an Interval Graphand a Split Dominating Set of a Circular-Arc Graph
... efficient dominating set of an interval family if it exists and Also an algorithm for finding a non- split dominating set of circular-arc ...
8
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set
... independent set (MIS), by derandomizing the randomized MIS algorithm of [16], using a method of conditional expectation close to Luby ...and dominating set (and presumably many other local problems), ...
17
Time- and Space-Efficient Self-Stabilizing Algorithms
... only. Self-stabilization is a general approach to make a distributed system tolerate arbitrary transient faults by ...A self-stabilizing algorithm reaches a legitimate configura- tion in a finite ...
160
Randomized Algorithms for Approximating a Connected Dominating Set in Wireless Sensor Networks
... Connected Dominating Set (CDS) of a graph rep- resenting a Wireless Sensor Network can be used as a virtual backbone for routing through the ...ized algorithms for constructing a CDS. We evaluate our ...
9
Online Dominating Set
... a dominating set for the whole ...comparing algorithms to an appropriate Opt already exists in the literature, to the best of our knowledge the focus also on the comparison of different optimum ...
15
Automated Analysis and Optimization of Distributed Self-Stabilizing Algorithms
... several stabilizing algo- rithms for the vertex coloring problem in arbitrary graphs ...scheduler-oblivious stabilizing algorithm is to compose it with a stabilizing mutual exclusion protocol with ...
79
Self stabilizing processes
... bounded set of ...bounded set of (X, Y) in such a way that there is a high probability that this will differ from the random function by at most a prescribed small ...
23
Graph Neural Network for Minimum Dominating Set
... GNN consumed huge amount of time for convergence with more number of hidden neurons. Table 1 and 2 show the number of nodes in the graph, number of hidden neurons in the GNN and the accuracies obtained when state ...
5
Multi Document Summarization via the Minimum Dominating Set
... a set of documents to gener- ate a compressed ...a set of documents where vertices repre- sent sentences and edges indicate that the corresponding vertices are simi- lar, the extracted summary can be de- ...
9
Self-stabilizing Distributed Data Fusion
... two algorithms have been presented for dealing with distributed imprecise an uncertain data in a ...These algorithms are self-stabilizing, meaning that, they converge in finite time in a ...
16
A PTAS for the minimum dominating set problem in unit disk graphs
... like dominating sets play an important role, ...the dominating set is an efficient way to ensure that it is received by all transmitters in the network, both in terms of energy and ...making ...
14
Solving the k-center Problem Efficiently with a Dominating Set Algorithm
... Since they rely on the integer programming, it would be interesting to see how they per- form on larger test instances. We have also found that, surprisingly, the performance of the well-known 2-approximation algorithm ...
9
A Finite Dominating Set Algorithm for a Dynamic Location Problem in the Plane
... known algorithms for the multifacility location problem with restricted areas, as the security guard possibly might “jump” around the lake, which does not yield a meaningful trajectory in our ...
16
A Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
... 4.5. Integrality gap Given that weighted EDS is as hard to approximate as weighted VC and that no polynomial- time algorithm with a constant performance guarantee strictly less than 2 is known for the latter, we might ...
10
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
... work Self-organization. In recent years, the concept of self-organization has been widely mentioned in the scope of distributed computing and peer to peer ...being self-organizing, but a mere ...
19
Distributed Computation of Connected Dominating Set for Multi-Hop Wireless Networks
... smallest set of dominant nodes for forwarding packets would be a good approach for better ...Connected dominating set (CDS) computation is one of the method to find important nodes in the ...
6
Self stabilizing processes based on random signs
... 0 u −α sin u du −1/α and where Π is a Poisson point process on R + × R with plane Lebesgue measure L 2 as mean measure, so that for a Borel set A ⊂ R + × R the number of points of Π in A has a Poisson distribution ...
16
Finding a weighted positive influence dominating set in e-learning social networks
... 3. Algorithms for dominating set 6 Conclusions and Future work In this paper, we have introduced and studied the problem of how to utilize online social network as a medium to improve users’ ...
10