Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2019.12.027 / rank
Normal rank
 
Property / author
 
Property / author: Michał Hanćkowiak / rank
Normal rank
 
Property / author
 
Property / author: Michał Hanćkowiak / 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.1016/j.tcs.2019.12.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2998224451 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126407006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Constant Factor MDS Approximation for Bounded Genus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient distributed algorithm for constructing small dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of the \(k\)-domination problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed minimum dominating set approximations in restricted families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sachs' linkless embedding conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local approximation algorithm for minimum dominating set problem in anonymous planar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2019.12.027 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:40, 17 December 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
    0 references
    0 references
    0 references
    0 references
    29 January 2020
    0 references
    distributed algorithms
    0 references
    dominating set
    0 references
    bounded-genus graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references