K-Dominating Sets: A Synchronous Distributed Algorithm: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:2014:20, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,022 bytes +2,022‎ Created page with "Title: k-Dominating Sets: A Synchronous Distributed Algorithm Abstract: This research focuses on finding k-dominating sets in a connected undirected graph G with n nodes and m edges. The algorithm aims to minimize the set's size, which is known to be at most ⌊n/(k+ 1)⌋. The research proposes a new synchronous distributed algorithm that improves on the previously known algorithm's message complexity and is conceptually simpler. Main Research Question: Can we develop..."
Retrieved from "https://simplesci.org/wiki/K-Dominating_Sets:_A_Synchronous_Distributed_Algorithm"