No label defined (Q5091165)

From MaRDI portal

Revision as of 17:38, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7561510

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

Statements

scholarly article

0 references

10.4230/LIPIcs.ICALP.2019.17

0 references

0 references

0 references

publication date

21 July 2022

0 references

full work available at URL

https://arxiv.org/abs/2006.07628

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

maximal independent set

0 references

maximal matching

0 references

sublinear-time algorithms

0 references

bounded neighborhood independence

0 references

MaRDI profile type

MaRDI publication profile

0 references

A fast and simple randomized parallel algorithm for the maximal independent set problem

0 references

0 references

Randomized greedy matching. II

0 references

Sublinear Algorithms for (Δ + 1) Vertex Coloring

0 references

Fully dynamic maximal independent set with sublinear update time

0 references

Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time

0 references

Distributed deterministic edge coloring using bounded neighborhood independence

0 references

Distributed Graph Coloring: Fundamentals and Recent Developments

0 references

Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time

0 references

Fully Dynamic Maximal Matching in $O(\log n)$ Update Time

0 references

On a division property of consecutive integers

0 references

0 references

Approximating the Caro-Wei bound for independent sets in graph streams

0 references

Randomized greedy matching

0 references

Claw-free graphs---a survey

0 references

On graph problems in a semi-streaming model

0 references

An Improved Distributed Algorithm for Maximal Independent Set

0 references

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

0 references

Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation

0 references

0 references

Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs

0 references

Streaming algorithms for independent sets in sparse hypergraphs

0 references

Wireless Scheduling with Power Control

0 references

Distributed large independent sets in one round on bounded-independence graphs

0 references

Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs

0 references

0 references

A fast and simple randomized parallel algorithm for maximal matching

0 references

What cannot be computed locally!

0 references

0 references

Local computation algorithms for graphs of non-constant degrees

0 references

Locality in Distributed Graph Algorithms

0 references

0 references

Simple Deterministic Algorithms for Fully Dynamic Maximal Matching

0 references

0 references

Fully dynamic MIS in uniformly sparse graphs

0 references

On the Complexity of Distributed Network Decomposition

0 references

A log-star distributed maximal independent set algorithm for growth-bounded graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091165

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091165&oldid=36832835"