On the public citation graph
A fast parallel algorithm for six-colouring of planar graphs
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(82)90093-xopenalex-snapshot
Parallel computation and conflicts in memory access
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_25openalex-snapshot
Parallel 5-colouring of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-18099-0_35openalex-snapshot
Parallel recognition of outerplanar graphs
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_36openalex-snapshot
Fast parallel algorithms for optimal edge-colouring of some tree-structured graphs
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_50openalex-snapshot
Colouring perfect planar graphs in parallel
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_68openalex-snapshot
Optimal parallel algorithms for the recognition and colouring outerplanar graphs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/s11786-019-00409-4openalex-snapshot
Vertex Coloring of a Graph for Memory Constrained Scenarios
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90092-5openalex-snapshot
A fast parallel coloring of planar graphs with five colors
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90080-4openalex-snapshot
Parallel O(log n) time edge-colouring of trees and Halin graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90046-0openalex-snapshot
Coloring planar graphs in parallel
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90051-iopenalex-snapshot
Optimally edge-colouring outerplanar graphs is in NC
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00103openalex-snapshot
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
inferred← citeshttps://doi.org/10.1137/0218020openalex-snapshot
Optimal Parallel 5-Colouring of Planar Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975482.49openalex-snapshot
Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
inferred← citeshttps://doi.org/10.1145/2612669.2612697openalex-snapshot
Ordering heuristics for parallel graph coloring
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.