Optimal Parallel 5-Colouring of Planar Graphs
From MaRDI portal
Recommendations
Cited in
(20)- scientific article; zbMATH DE number 4090822 (Why is no real title available?)
- Parallel algorithms with optimal speedup for bounded treewidth
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- Planar orientations with low out-degree and compaction of adjacency matrices
- scientific article; zbMATH DE number 17801 (Why is no real title available?)
- Optimal parallel algorithms on planar graphs
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- Efficient computation of implicit representations of sparse graphs
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- Optimal parallel 3-coloring algorithm for rooted trees and its applications
- scientific article; zbMATH DE number 3968611 (Why is no real title available?)
- scientific article; zbMATH DE number 4047151 (Why is no real title available?)
- An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- An optimal parallel algorithm for minimum spanning trees in planar graphs
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
- An efficient parallel algorithm for computing a large independent set in a planar graph
- Oriented 5-coloring of sparse plane graphs
- Colouring perfect planar graphs in parallel
- NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
This page was built for publication: Optimal Parallel 5-Colouring of Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4207597)
