An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs |
scientific article |
Statements
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (English)
0 references
11 December 2009
0 references
permutation graphs
0 references
paired-domination
0 references
domination
0 references
algorithms
0 references
complexity
0 references
