An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph (Q4877526): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Sudarshan K. Dhall / rank | |||
Property / author | |||
Property / author: Sudarshan K. Dhall / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/s0097539794200383 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2022850650 / rank | |||
Normal rank |
Latest revision as of 10:15, 30 July 2024
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