• Publications
  • Influence
Linear time self-stabilizing colorings
We propose two new self-stabilizing distributed algorithms for proper Δ + 1 (Δ is the maximum degree of a mode in the graph) colorings of arbitrary system graphs. Both algorithms are capable ofExpand
The Private Neighbor Cube
A set of eight graph theoretic parameters can be defined whose inequality relationships can be described by a three-dimensional cube and this paper helps to form a cohesive theory of private neighbors in graphs. Expand
Distance- k knowledge in self-stabilizing algorithms
This work provides a general transformation for constructing self-stabilizing algorithms which utilize distance-k knowledge, and can be generalized to efficiently find maximal P-sets, for properties P which the authors call local monotonic. Expand
A simple heuristic for maximizing service of carousel storage
A simple heuristic is presented that prescribes how many cases of each item type should be loaded in a system that stores cases of items and can be computed in time linear in the number of item types. Expand
Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Sets
In the self-stabilizing algorithmic paradigm for distributed computation each node has only a local view of the system, yet in a finite amount of time, the system converges to a global stateExpand
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs†
This work provides self-stabilizing algorithms (in the shared-variable ID-based model) for three graph optimization problems: a minimal total dominating set, a maximal k-packing, and a maximal strong matching. Expand
Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks
The paradigm to analyze the complexity of the self-stabilizing algorithms in the context of ad hoc networks is very different from the traditional concept of an adversary daemon used in proving the convergence and correctness of self-Stabilizing distributed algorithms in general. Expand
On the computational complexity of upper fractional domination
It is shown that Γ ⨍ (G) is computable and is always a rational number, and the decision problems corresponding to the problems of computing Γ ( G ) and Γ⩽ ( G) are NP-complete; this implies that the value ofΓ ⩽ can be computed in linear time. Expand
Self-Stabilizing Graph Protocols
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under aExpand
Domination Subdivision Numbers
It is shown that sdγ (G) ≤ γ(G)+1 for any graph G without isolated vertices, and constant upper bounds on sdγ(G) for several families of graphs are given. Expand