An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs (Q1933642): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2011.10.011 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2011.10.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2173544181 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2011.10.011 / rank | |||
Normal rank | |||
Latest revision as of 13:38, 16 December 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
