Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. (Q1398783): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0743-7315(03)00040-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104235299 / rank | |||
Normal rank | |||
Latest revision as of 09:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. |
scientific article |
Statements
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. (English)
0 references
7 August 2003
0 references
Distributed algorithms
0 references
Distance-\(k\) dominating set
0 references
Interconnection networks
0 references
Directed split-stars
0 references
