An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph (Q4877526)
From MaRDI portal
scientific article; zbMATH DE number 878163
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph |
scientific article; zbMATH DE number 878163 |
Statements
An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph (English)
0 references
10 November 1996
0 references
dominating set
0 references
permutation graphs
0 references
