An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs (Q4985488)
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: An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs |
scientific article; zbMATH DE number 7337255
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs |
scientific article; zbMATH DE number 7337255 |
Statements
An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (English)
0 references
23 April 2021
0 references
algorithms
0 references
\(k\)-hop connected domination
0 references
permutation graphs
0 references
0 references
0 references
0 references
0 references
0.8737112283706665
0 references
0.8302360773086548
0 references
0.8265638947486877
0 references
0.8216560482978821
0 references
0.8209864497184753
0 references
