Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639): 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/j.tcs.2019.12.027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2998224451 / rank | |||
Normal rank | |||
Revision as of 20:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs |
scientific article |
Statements
Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (English)
0 references
29 January 2020
0 references
distributed algorithms
0 references
dominating set
0 references
bounded-genus graphs
0 references
