Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference56 articles.
1. Compact routing for graphs excluding a fixed minor;Abraham,2005
2. The local detection paradigm and its application to self-stabilization;Afek;Theoret. Comput. Sci.,1997
3. S.A. Amiri, P.O. de Mendez, R. Rabinovich, S. Siebertz, Distributed Domination on Graph Classes of Bounded Expansion, in: 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, 2018, pp. 143–151, http://dx.doi.org/10.1145/3210377.3210383.
4. S.A. Amiri, S. Schmid, S. Siebertz, A Local Constant Factor MDS Approximation for Bounded Genus Graphs, in: ACM Symposium on Principles of Distributed Computing, PODC, 2016, pp. 227–233, http://dx.doi.org/10.1145/2933057.2933084.
5. Distributed dominating set approximations beyond planar graphs;Amiri;ACM Trans. Algorithms,2019
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. A lower bound for constant-size local certification;Theoretical Computer Science;2023-09