Some simple distributed algorithms for sparse networks (Q5138354): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Scheduling parallel I/O operations in multiple bus systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of approximate algorithms for edge-coloring bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel \((\Delta +1)\)-coloring of constant-degree graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A faster distributed algorithm for computing maximal matchings deterministically / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Locality in Distributed Graph Algorithms / rank | |||
Normal rank | |||
Revision as of 04:00, 24 July 2024
scientific article; zbMATH DE number 7281842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some simple distributed algorithms for sparse networks |
scientific article; zbMATH DE number 7281842 |
Statements
Some simple distributed algorithms for sparse networks (English)
0 references
3 December 2020
0 references
distributed computing
0 references
sparse networks
0 references
maximal independent set
0 references
maximal matching
0 references
vertex colouring
0 references
edge colouring
0 references
