On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (Q1016039): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-007-9124-y / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-007-9124-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038841453 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-007-9124-Y / rank | |||
Normal rank | |||
Latest revision as of 03:29, 28 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs |
scientific article |
Statements
On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs (English)
0 references
4 May 2009
0 references
\(k\)-dominating set
0 references
\(m\)-connectivity
0 references
unit disc graph
0 references
approximation algorithm
0 references
wireless sensor networks
0 references
