A fast parallel coloring of planar graphs with five colors (Q1108037): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(87)90092-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2016216976
@@ Property / OpenAlex ID: W2016216976 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Q3708831
@@ Property / cites work: Q3708831 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring planar graphs in parallel
@@ Property / cites work: Coloring planar graphs in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Q3917502
@@ Property / cites work: Q3917502 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3735725
@@ Property / cites work: Q3735725 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+A batching method for coloring planar graphs
@@ Property / cites work: A batching method for coloring planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank