On-line algorithms for the dominating set problem (Q290186): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Finding a minimum independent dominating set in a permutation graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The greedy algorithm is optimal for on-line edge coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Competitive algorithms for server problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00191-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031490900 / rank | |||
Normal rank | |||
Latest revision as of 08:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line algorithms for the dominating set problem |
scientific article |
Statements
On-line algorithms for the dominating set problem (English)
0 references
1 June 2016
0 references
online algorithms
0 references
dominating set
0 references
