A distributed algorithm to find \(k\)-dominating sets (Q1827867): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: How to Allocate Network Centers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A trade-off between space and efficiency for routing tables / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00368-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2165479724 / rank | |||
Normal rank |
Latest revision as of 09:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A distributed algorithm to find \(k\)-dominating sets |
scientific article |
Statements
A distributed algorithm to find \(k\)-dominating sets (English)
0 references
6 August 2004
0 references
\(k\)-Dominating sets
0 references
Distributed algorithms
0 references
Graph algorithms
0 references