Pages that link to "Item:Q1108037"
From MaRDI portal
The following pages link to A fast parallel coloring of planar graphs with five colors (Q1108037):
Displaying 4 items.
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
