An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors (Q914387): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for edge coloring problems
+Normal rank
@@ Property / cites work @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for edge-coloring planar graphs
@@ Property / cites work: Fast algorithms for edge-coloring planar graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(90)90079-w
+Normal rank
@@ Property / OpenAlex ID @@
+W2031355167
@@ Property / OpenAlex ID: W2031355167 / rank @@
+Normal rank