Pages that link to "Item:Q3792256"
From MaRDI portal
The following pages link to A fast parallel algorithm to color a graph with Δ colors (Q3792256):
Displaying 10 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- An NC algorithm for Brooks' theorem (Q1124351) (← links)
- A parallel variant of a heuristical algorithm for graph colouring (Q1262783) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- Optimal parallel algorithm for Brooks' colouring bounded degree graphs in logarithmic time on EREW PRAM (Q1917253) (← links)
- Brooks Coloring in Parallel (Q3031926) (← links)
- (Q3708831) (← links)
- Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring (Q6083481) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)