论文标题

完全晶格线性算法

Fully Lattice Linear Algorithms

论文作者

Gupta, Arya Tanmay, Kulkarni, Sandeep S

论文摘要

本文着重于分析和区分晶格线性问题和算法。它引入了一种新的算法类,称为\ textit {((完全)晶格线性算法}。这些算法的属性是,它们在所有状态中诱导部分顺序,并形式\ textit {多个晶格}。初始状态锁定在这些晶格之一中。我们提出了一种晶格线性自动稳定算法,用于最小的主导集。

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

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源