A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2006.09.004
@@ Property / DOI: 10.1016/j.ipl.2006.09.004 / 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.ipl.2006.09.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2074329201
@@ Property / OpenAlex ID: W2074329201 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
+Normal rank
@@ Property / cites work @@
+Coloring planar graphs in parallel
@@ Property / cites work: Coloring planar graphs in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Improved edge-coloring algorithms for planar graphs
+Normal rank
@@ Property / cites work @@
+Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
+Normal rank
@@ Property / cites work @@
+Self-stabilizing systems in spite of distributed control
+Normal rank
@@ Property / cites work @@
+Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
+Normal rank
@@ Property / cites work @@
+A self-stabilizing algorithm for coloring planar graphs
+Normal rank
@@ Property / cites work @@
+Nearly optimal distributed edge coloring in O(log log n) rounds
+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 @@
+Self-stabilizing coloration in anonymous planar networks
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for edge coloring problems
+Normal rank
@@ Property / cites work @@
+An experimental study of a simple, distributed edge-coloring algorithm
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2006.09.004
@@ Property / DOI: 10.1016/J.IPL.2006.09.004 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:845924