A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394): Difference between revisions

@@ 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.2013.11.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2078400655
@@ Property / OpenAlex ID: W2078400655 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Distributed Approximations in Planar Graphs
@@ Property / cites work: Fast Distributed Approximations in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for local approximation
@@ Property / cites work: Lower bounds for local approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed minimum dominating set approximations in restricted families of graphs
+Normal rank
@@ Property / cites work @@
+Leveraging Linial’s Locality Limit
@@ Property / cites work: Leveraging Linial’s Locality Limit / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Survey of local algorithms
@@ Property / cites work: Survey of local algorithms / rank @@
+Normal rank