Author:
Montealegre Pedro,Ramírez-Romero Diego,Rapaport Ivan
Publisher
Springer International Publishing
Reference40 articles.
1. Assadi, S., Kol, G., Oshman, R.: Lower bounds for distributed sketching of maximal matchings and maximal independent sets. In: Emek, Y., Cachin, C. (eds.) PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, 3–7 August 2020, pp. 79–88. ACM (2020)
2. Baruch, M., Fraigniaud, P., Patt-Shamir, B.: Randomized proof-labeling schemes. In: Symposium on Principles of Distributed Computing, pp. 315–324 (2015)
3. Bousquet, N., Feuilloley, L., Pierron, T.: Local certification of graph decompositions and applications to minor-free classes. arXiv preprint arXiv:2108.00059 (2021)
4. Brandstadt, A., Spinrad, J.P., et al.: Graph Classes: A Survey, vol. 3. SIAM (1999)
5. Broersma, H., Dahlhaus, E., Kloks, T.: A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Discret. Appl. Math. 99(1–3), 367–400 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献