Finding minimum dominating cycles in permutation graphs (Q1060966): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(85)90044-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986855028 / rank | |||
Normal rank | |||
Revision as of 00:31, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding minimum dominating cycles in permutation graphs |
scientific article |
Statements
Finding minimum dominating cycles in permutation graphs (English)
0 references
1985
0 references
A dominating cycle for a graph \(G=(V,E)\) is a subset C of V which has the following properties: (i) the subgraph of G induced by C has a Hamiltonian cycle, and (ii) every vertex of V is adjacent to some vertex of C. In this paper, we develop an \(O(n^ 2)\) algorithm for finding a minimum cardinality dominating cycle in a permutation graph. We also show that a minimum cardinality dominating cycle in a permutation graph always has an even number of vertices unless it is isomorphic to \(C_ 3\).
0 references
dominating set
0 references
polynomial algorithm
0 references
dominating cycle
0 references
subgraph
0 references
Hamiltonian cycle
0 references
permutation graph
0 references
