Relationship between optimal \(k\)-distance dominating sets in a weighted graph and its spanning trees (Q2414036)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7053439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relationship between optimal \(k\)-distance dominating sets in a weighted graph and its spanning trees |
scientific article; zbMATH DE number 7053439 |
Statements
Relationship between optimal \(k\)-distance dominating sets in a weighted graph and its spanning trees (English)
0 references
10 May 2019
0 references
\(k\)-distance dominating set
0 references
weighted graph
0 references
spanning tree
0 references
graph algorithms
0 references
0.8295111060142517
0 references
0.7574892640113831
0 references
0.7425887584686279
0 references
