Publisher
Springer International Publishing
Reference25 articles.
1. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994). https://doi.org/10.1145/174644.174650
2. Bast, H., Mehlhorn, K., Schäfer, G., Tamaki, H.: Matching algorithms are fast in sparse random graphs. Theor. Comput. Syst. 39(1), 3–14 (2006). https://doi.org/10.1007/s00224-005-1254-y
3. Berge, C.: Graphs and Hypergraphs, 2nd edn. North-Holland (1976). Translated from Graphes et Hypergraphes, Dunod (1970)
4. Biedl, T., Bose, P., Demaine, E.D., Lubiw, A.: Efficient algorithms for Petersen’s matching theorem. J. Algorithms 38(1), 110–134 (2001). https://doi.org/10.1006/jagm.2000.1132
5. Biedl, T., Klute, F.: Finding large matchings in 1-planar graphs of minimum degree 3 (2020). CoRR 2002.11818. http://arxiv.org/abs/2002.11818
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献