Q5091165 (Q5091165): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Q5743464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized greedy matching. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Algorithms for (Δ + 1) Vertex Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic maximal independent set with sublinear update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed deterministic edge coloring using bounded neighborhood independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Graph Coloring: Fundamentals and Recent Developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Maximal Matching in $O(\log n)$ Update Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a division property of consecutive integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Caro-Wei bound for independent sets in graph streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized greedy matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithms for independent sets in sparse hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless Scheduling with Power Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed large independent sets in one round on bounded-independence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250185 / 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: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIS on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local computation algorithms for graphs of non-constant degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Deterministic Algorithms for Fully Dynamic Maximal Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic MIS in uniformly sparse 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: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank

Revision as of 17:38, 29 July 2024

scientific article; zbMATH DE number 7561510
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561510

    Statements

    0 references
    0 references
    21 July 2022
    0 references
    0 references
    maximal independent set
    0 references
    maximal matching
    0 references
    sublinear-time algorithms
    0 references
    bounded neighborhood independence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references