An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (Q1933642)
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: An O(n)-time algorithm for the paired domination problem on permutation graphs |
scientific article; zbMATH DE number 6128659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs |
scientific article; zbMATH DE number 6128659 |
Statements
An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (English)
0 references
24 January 2013
0 references
sweeping algorithm
0 references
minimum-cardinality dominating set
0 references
0.9965202808380128
0 references
0.9248650670051576
0 references
0.8336507678031921
0 references
0.8244600892066956
0 references
