A fast parallel coloring of planar graphs with five colors (Q1108037): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Every planar map is four colorable. I: Discharging / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3708831 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring planar graphs in parallel / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3917502 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3735725 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A batching method for coloring planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank | |||
Normal rank |
Latest revision as of 18:46, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast parallel coloring of planar graphs with five colors |
scientific article |
Statements
A fast parallel coloring of planar graphs with five colors (English)
0 references
1987
0 references
coloring of planar graphs
0 references
parallel algorithms
0 references