Author:
Gao Pu,Kamiński Bogumił,MacRury Calum,Prałat Paweł
Funder
Natural Sciences and Engineering Research Council of Canada
Subject
Discrete Mathematics and Combinatorics
Reference13 articles.
1. O. Ben-Eliezer, L. Gishboliner, D. Hefetz, M. Krivelevich, Very fast construction of bounded degree spanning graphs via the semi-random graph process, in: Proceedings of the 31st Symposium on Discrete Algorithms, SODA’20, 2020, pp. 728–737.
2. Semi-random graph process;Ben-Eliezer;Random Struct. Algorithms,2020
3. Julia: A fresh approach to numerical computing;Bezanson;SIAM Rev.,2017
4. Hamilton cycles in 3-out;Bohman;Random Struct. Algorithms,2009
5. A modeling language for mathematical optimization;Dunning;SIAM Rev.,2017
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献