Pages that link to "Item:Q1252864"
From MaRDI portal
The following pages link to A batching method for coloring planar graphs (Q1252864):
Displaying 9 items.
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- On linear-time algorithms for five-coloring planar graphs (Q1057278) (← links)
- A fast parallel coloring of planar graphs with five colors (Q1108037) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- Parallel construction of subdivision hierarchies (Q1124347) (← links)
- Batch sizes for the batching method of colouring planar maps (Q1153098) (← links)
- Planar graphs with few vertices of small degree (Q1897428) (← links)
- Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576) (← links)