Pages that link to "Item:Q1917253"
From MaRDI portal
The following pages link to Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253):
Displaying 7 items.
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- Local nature of Brooks' colouring for degree 3 graphs (Q1423503) (← links)
- Brooks Coloring in Parallel (Q3031926) (← links)
- Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model' (Q3493247) (← links)
- Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model (Q3801099) (← links)
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5894617) (← links)
- Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring (Q6083481) (← links)