On linear-time algorithms for five-coloring planar graphs
Information Processing Letters
A fast parallel coloring of planar graphs with five colors
Information Processing Letters
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
Optimal parallel 5-colouring of planar graphs
SIAM Journal on Computing
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Two linear-time algorithms for five-coloring a planar graph
Two linear-time algorithms for five-coloring a planar graph
Graphs and Hypergraphs
Hi-index | 0.00 |