Distributed minimum dominating set approximations in restricted families of graphs (Q360271): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-013-0186-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048769918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed (δ+1)-coloring in linear (in δ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Almost Exact Approximations for Minor-Closed Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Distributed Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic algorithms for the wake-up problem in single-hop radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation of capacitated dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leveraging Linial’s Locality Limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Dominating Set Approximation in Graphs of Bounded Arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring / 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: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Is the Use of Collision Detection (in Wireless Networks)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs / rank
 
Normal rank

Latest revision as of 19:43, 6 July 2024

scientific article
Language Label Description Also known as
English
Distributed minimum dominating set approximations in restricted families of graphs
scientific article

    Statements

    Distributed minimum dominating set approximations in restricted families of graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    upper bound
    0 references
    lower bound
    0 references
    unit disk
    0 references
    bounded arboricity
    0 references
    planar
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references