The 2-neighbourhood covering problem on permutation graphs (Q2793037)
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: The 2-neighbourhood covering problem on permutation graphs |
scientific article; zbMATH DE number 6555455
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 2-neighbourhood covering problem on permutation graphs |
scientific article; zbMATH DE number 6555455 |
Statements
14 March 2016
0 references
design of algorithms
0 references
analysis of algorithms
0 references
permutation graph
0 references
\(k\)-neighbourhood covering
0 references
0.90535766
0 references
0.8996141
0 references
0.88300616
0 references
0.88272566
0 references
0.87056774
0 references
The 2-neighbourhood covering problem on permutation graphs (English)
0 references
