Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrzej Czygrinow / rank
Normal rank
 
Property / author
 
Property / author: Michał Hanćkowiak / rank
Normal rank
 
Property / author
 
Property / author: Edyta Szymańska / rank
Normal rank
 
Property / author
 
Property / author: Wojciech Wawrzyniak / rank
Normal rank
 
Property / author
 
Property / author: Marcin Witkowski / rank
Normal rank
 
Property / author
 
Property / author: Andrzej Czygrinow / rank
 
Normal rank
Property / author
 
Property / author: Michał Hanćkowiak / rank
 
Normal rank
Property / author
 
Property / author: Edyta Szymańska / rank
 
Normal rank
Property / author
 
Property / author: Wojciech Wawrzyniak / rank
 
Normal rank
Property / author
 
Property / author: Marcin Witkowski / 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.2016.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2561474155 / 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: Lower bounds for local approximation / 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: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs / 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: The Algorithmic Complexity of k-Domatic Partition of Graphs / 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: Survey of local algorithms / 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
links / mardi / namelinks / mardi / name
 

Revision as of 06:13, 13 July 2024

scientific article
Language Label Description Also known as
English
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
scientific article

    Statements

    Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (English)
    0 references
    9 January 2017
    0 references
    distributed graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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