Fully Lattice Linear Algorithms
share
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called (fully) lattice linear algorithms. A property of these algorithms is that they induce a partial order among all states and form multiple lattices. An initial state locks in one of these lattices. We present a lattice linear self-stabilizing algorithm for minimal dominating set.
READ FULL TEXT