On the complexity of distributed graph coloring with local minimality constraints (Q3057099): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4229960859
@@ Property / OpenAlex ID: W4229960859 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62048702
@@ Property / Wikidata QID: Q62048702 / rank @@
+Normal rank
@@ Property / cites work @@
+Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
+Normal rank
@@ Property / cites work @@
+Algorithms for some graph problems on a distributed computational model
+Normal rank
@@ Property / cites work @@
+The train marshalling problem
@@ Property / cites work: The train marshalling problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Distributed Algorithms for Brooks–Vizing Colorings
+Normal rank
@@ Property / cites work @@
+Simple distributed \(\Delta+1\)-coloring of graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of distributed graph coloring
@@ Property / cites work: On the complexity of distributed graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Legal coloring of graphs
@@ Property / cites work: Legal coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Welsh-Powell opposition graphs
@@ Property / cites work: Welsh-Powell opposition graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Distributed Network Decomposition
+Normal rank
@@ Property / cites work @@
+Almost all k-colorable graphs are easy to color
@@ Property / cites work: Almost all k-colorable graphs are easy to color / rank @@
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank