Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328): Difference between revisions

@@ Property / cites work @@
+Q3735725
@@ Property / cites work: Q3735725 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic index of outerplanar graphs
@@ Property / cites work: On the chromatic index of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3853641
@@ Property / cites work: Q3853641 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallelism in random access machines
@@ Property / cites work: Parallelism in random access machines / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Algorithms in Graph Theory: Planarity Testing
+Normal rank
@@ Property / cites work @@
+A fast parallel algorithm for routing in permutation networks
+Normal rank
@@ Property / cites work @@
+Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
+Normal rank
@@ Property / cites work @@
+Q3343454
@@ Property / cites work: Q3343454 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3322145
@@ Property / cites work: Q3322145 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Parallel Biconnectivity Algorithm
@@ Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank @@
+Normal rank