Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:04, 2 February 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
