Pages that link to "Item:Q5894617"
From MaRDI portal
The following pages link to Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5894617):
Displaying 6 items.
- Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631) (← links)
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- Optimal parallel 3-colouring algorithm for rooted trees and its application (Q3979273) (← links)
- (Q4290645) (← links)