Pages that link to "Item:Q3975003"
From MaRDI portal
The following pages link to Parallel colouring of random graphs (Q3975003):
Displaying 13 items.
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- A parallel variant of a heuristical algorithm for graph coloring -- corrigendum (Q1200998) (← links)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- A processor efficient MIS algorithm on random graphs (Q1318767) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Parallel graph algorithms that are efficients on average (Q1825648) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- Brooks Coloring in Parallel (Q3031926) (← links)
- On-Line Coloring of Sparse Random Graphs and Random Trees (Q3128993) (← links)
- The greedy coloring is a bad probabilistic algorithm (Q3988828) (← links)
- Parallel and On-Line Graph Coloring (Q4339004) (← links)
- Scalable parallel graph coloring algorithms (Q4790880) (← links)