Local algorithms for edge colorings in UDGs (Q638541): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.05.005
@@ Property / DOI: 10.1016/j.tcs.2011.05.005 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.05.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2013435921
@@ Property / OpenAlex ID: W2013435921 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Link scheduling in wireless sensor networks: distributed edge-coloring revisited
+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 @@
+Algorithms for finding distance-edge-colorings of graphs
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of strong edge coloring
+Normal rank
@@ Property / cites work @@
+A constructive proof of Vizing's theorem
@@ Property / cites work: A constructive proof of Vizing's theorem / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.05.005
@@ Property / DOI: 10.1016/J.TCS.2011.05.005 / rank @@
+Normal rank