The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a graph G = (V, E), a node is called perfect (with respect to a set S ⊆ V) if its closed neighborhood contains exactly one node in set S, a node is called nearly perfect if it is not perfect but is adjacent to a perfect node. S is called a perfect neighborhood set if each node is either perfect or nearly perfect. We present the first self-stabilizing algorithm for computing a perfect neighborhood...
The selection mechanism of sensory organ precursor(SOP) from pre-neural cells of fruity fly has recently beenused to develop a new computing paradigm for probabilistic (randomized) distributed algorithms for graph theoretic primitiveslike maximal independent set (MIS) in networks [1]. The newparadigm is significantly different from the settings of traditionaldistributed algorithms [2], [3], [4], [5]:...
Selection of Influential Users is an essential task in influence propagation schemes in social networks. Considering the phenomenon of asymmetric influences between neigh boring users and different sensitivities of users to influences, we propose to select the users in the minimal weighted positive influence dominating set of a social network graph as the influential users to maximize the speed of...
In a graph or a network G = (V, E), a set S ⊆ V is a 2-packing if ∀i ∊ V : |N[i]∩S| ≤ 1, where N[i] denotes the closed neighborhood of node i. A 2-packing is maximal if no proper superset of S is a 2-packing. This paper presents a safely converging self-stabilizing algorithm for maximal 2-packing problem. Under a synchronous daemon,...
Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization. We consider the model where there is one designated master node and all other nodes are anonymous and have constant space. Recently, Lee et al. obtained such an algorithm for determining the size of a unidirectional ring. We provide...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.