Algorithms on Graphs with Small Dominating Targets (Q5459110)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms on Graphs with Small Dominating Targets |
scientific article; zbMATH DE number 5267581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms on Graphs with Small Dominating Targets |
scientific article; zbMATH DE number 5267581 |
Statements
Algorithms on Graphs with Small Dominating Targets (English)
0 references
24 April 2008
0 references
dominating target
0 references
\(d\)-octopus
0 references
dominating set
0 references
dominating-pair graph
0 references
Steiner tree.
0 references
0.7966793775558472
0 references
0.7939639091491699
0 references
0.7939639091491699
0 references
0.7926541566848755
0 references
