Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058): 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.1007/s10878-010-9372-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036620201 / rank | |||
Normal rank |
Revision as of 22:56, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem |
scientific article |
Statements
Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (English)
0 references
17 July 2012
0 references
\(k\)-fold dominating set
0 references
slab decomposition
0 references
algorithm
0 references
unit ball graph
0 references