Pages that link to "Item:Q1108036"
From MaRDI portal
The following pages link to Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036):
Displaying 12 items.
- Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- Coloring unstructured radio networks (Q2377260) (← links)
- Optimal parallel 3-colouring algorithm for rooted trees and its application (Q3979273) (← links)
- (Q4940090) (← links)
- Introduction to local certification (Q5024672) (← links)
- (Q5075750) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Some simple distributed algorithms for sparse networks (Q5138354) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)