An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs (Q5069774)
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 7509108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs |
scientific article; zbMATH DE number 7509108 |
Statements
An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (English)
0 references
19 April 2022
0 references
design of algorithms
0 references
analysis of algorithms
0 references
permutation graph
0 references
\(k\)-domination
0 references
caterpillar
0 references
0 references
0 references
0.8297947645187378
0 references
0.8209509253501892
0 references
0.8206322193145752
0 references
0.8143745064735413
0 references
