Some simple distributed algorithms for sparse networks (Q5138354): Difference between revisions

@@ Property / Wikidata QID @@
+Q56269095
@@ Property / Wikidata QID: Q56269095 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling parallel I/O operations in multiple bus systems
+Normal rank
@@ Property / cites work @@
+Analysis of approximate algorithms for edge-coloring bipartite graphs
+Normal rank
@@ Property / cites work @@
+Parallel \((\Delta +1)\)-coloring of constant-degree graphs
+Normal rank
@@ Property / cites work @@
+Parallel Symmetry-Breaking in Sparse Graphs
@@ Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A faster distributed algorithm for computing maximal matchings deterministically
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/pl00008932
+Normal rank
@@ Property / OpenAlex ID @@
+W2006040238
@@ Property / OpenAlex ID: W2006040238 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5138354