An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:00, 8 February 2024
scientific article; zbMATH DE number 7509108
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to solve the distance<i>k</i>-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
