Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7159814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs |
scientific article; zbMATH DE number 7159814 |
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
0 references
0 references
0.8347125053405762
0 references
0.8267321586608887
0 references
0.8140841126441956
0 references
0.8137739300727844
0 references
