An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/09720529.2014.986906 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2440158214 / rank | |||
Normal rank | |||
Revision as of 22:33, 19 March 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
