arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2209.14703cs.DCcs.DS
收藏

全格线性算法

Fully Lattice Linear Algorithms

Arya Tanmay Gupta, Sandeep S Kulkarni

摘要:

本文着重于分析和区分格线性问题和算法。它引入了一类新的算法,称为\textit{(fully) lattice linear algorithms}。这些算法的一个性质是它们在所有状态之间引入偏序并形成\textit{multiple lattices}。初始状态锁定在其中一个晶格中。提出了一种求极小支配集的格线性自稳定算法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑