An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (Q1933642): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:26, 1 February 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
24 January 2013
0 references
sweeping algorithm
0 references
minimum-cardinality dominating set
0 references
