The following pages link to (Q3783598):
Displaying 8 items.
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
- A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) (← links)
- Fast parallel edge colouring of graphs. (Q1414732) (← links)
- A fast parallel algorithm to color a graph with Δ colors (Q3792256) (← links)
- Optimal parallel 3-colouring algorithm for rooted trees and its application (Q3979273) (← links)
- Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)