Pages that link to "Item:Q4207597"
From MaRDI portal
The following pages link to Optimal Parallel 5-Colouring of Planar Graphs (Q4207597):
Displayed 12 items.
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610) (← links)
- An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (Q3464472) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems (Q6122231) (← links)