Pages that link to "Item:Q5906512"

The following pages link to Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5906512):

Displaying 2 items.

• Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5894617) (← links)