Q5090932 (Q5090932): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 17:31, 29 July 2024

scientific article; zbMATH DE number 7561291

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

Statements

scholarly article

0 references

0 references

0 references

publication date

21 July 2022

0 references

zbMATH Keywords

distributed graph algorithms

0 references

coloring

0 references

congested clique

0 references

MaRDI profile type

MaRDI publication profile

0 references

An optimal distributed (Δ+1)-coloring algorithm?

0 references

Distributed MIS via All-to-All Communication

0 references

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

0 references

Distributed (∆+1)-coloring in sublogarithmic rounds

0 references

Lessons from the congested clique applied to MapReduce

0 references

0 references

Local Computation

0 references

Optimal deterministic routing and sorting on the congested clique

0 references

Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds

0 references

(Delta+1) Coloring in the Congested Clique Model

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.DISC.2018.39

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5090932

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