Pages that link to "Item:Q1414732"
From MaRDI portal
The following pages link to Fast parallel edge colouring of graphs. (Q1414732):
Displaying 8 items.
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) (← links)
- Parallel algorithms for the edge-coloring and edge-coloring update problems (Q1911806) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- (Q3708831) (← links)
- (Q3783598) (← links)
- A fast parallel algorithm to color a graph with Δ colors (Q3792256) (← links)
- Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)