Much faster algorithms for 738 matrix scaling, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS, vol.739, pp.890-901, 2017. ,
Randomized greedy matching II ,
, Structures & Algorithms, vol.6, issue.1, pp.55-73, 1995.
Coresets meet edcs: algorithms 743 for matching and vertex cover on massive graphs, Proceedings of the Thirtieth Annual 744 ACM-SIAM Symposium on Discrete Algorithms, pp.1616-1635, 2019. ,
Towards a unified theory of sparsification for matching problems, vol.746, 2018. ,
,
, Massively parallel computation of matching and mis in sparse graphs, Proceedings of the 749 2019 ACM Symposium on Principles of Distributed Computing, p.750, 2019.
Fully dynamic matching: Beating 2-approximation in 751 ? update time, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete, p.752 ,
, Algorithms, pp.2492-2508, 2020.
Two theorems in graph theory, Proceedings of the National Academy of Sciences of 754 the USA, vol.43, pp.842-844, 1957. ,
Fully dynamic matching in bipartite graphs, p.756 ,
, Colloquium on Automata, Languages, and Programming, p.757, 2015.
, Greedy matching: Guarantees and limitations. Algorithmica, 758, vol.77, pp.201-234, 2017.
Matrix scaling and balancing via box 760 constrained newton's method and interior point methods, 58th IEEE Annual Symposium 761 on Foundations of Computer Science, FOCS, pp.902-913, 2017. ,
Round compression 764 for parallel matching algorithms, Proceedings of the 50th Annual ACM SIGACT Symposium 765 on Theory of Computing, p.766, 2018. ,
The University of Florida sparse matrix collection, ACM Transactions 767 on Mathematical Software, vol.38, issue.1, 2011. ,
On algorithms for obtaining a maximum transversal, ACM Transactions on 769 Mathematical Software, vol.7, issue.3, pp.315-330, 1981. ,
Design, implementation, and analysis of maximum transversal 771 algorithms, ACM Transactions on Mathematical Software, vol.38, p.31, 2011. ,
Approximation algorithms for maximum 773 matchings in undirected graphs, Proceedings of the Seventh SIAM Workshop on, p.774, 2018. ,
, Combinatorial Scientific Computing, pp.56-65, 2018.
Two approximation algorithms for bipartite matching on 776 multicore architectures, Journal of Parallel and Distributed Computing, vol.85, p.777, 2015. ,
On random k-out subgraphs of large graphs, Random Structures, vol.778, issue.2, pp.143-157, 2017. ,
Perfect matchings in O(n log n) time in regular bipartite 780 graphs, SIAM Journal on Computing, vol.42, issue.3, pp.1392-1404, 2013. ,
A new approach to the maximum-flow problem, J. ACM, 782, vol.35, issue.4, pp.921-940, 1988. ,
Maintaining discrete probability distributions 784 optimally, 20th International Colloquium 785 on Automata, Languages, and Programming (ICALP), pp.253-264, 1993. ,
An n 5/2 algorithm for maximum matchings in bipartite 788 graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973. ,
Average case analysis of a heuristic for 790 the assignment problem, Mathematics of Operations Research, vol.19, issue.3, p.791, 1994. ,
Maximum matching in sparse random graphs, 22nd Annual 792 IEEE Symposium on Foundations of Computer Science (FOCS), p.793 ,
, , 1981.
An optimal algorithm for on-line bipartite 795 matching, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.796 ,
, STOC '90, pp.352-358, 1990.
Push-relabel based algorithms for the maximum 798 transversal problem, Computers & Operations Research, vol.40, issue.5, pp.1266-1275, 2013. ,
Karp-Sipser based kernels for bipartite 800 graph matching, SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), vol.801, pp.134-145, 2020. ,
The Sinkhorn-Knopp algorithm: Convergence and applications, SIAM Journal 803 on Matrix Analysis and Applications, vol.30, issue.1, pp.261-275, 2008. ,
A fast algorithm for matrix balancing, IMA Journal of Numerical 805 Analysis, vol.33, issue.3, pp.1029-1047, 2013. ,
Data reduction for maximum 807 matching on real-world graphs: Theory and experiments, 26th Annual European Symposium 808 on Algorithms (ESA 2018), vol.112, p.809, 2018. ,
Heuristic initialization for bipartite matching problems, Journal of Experimental Algorithmics (JEA), vol.810, pp.1-22, 2010. ,
Greedy matching algorithms, an experimental study, Journal of Experimental, vol.812 ,
, Algorithmics, vol.3, issue.6, 1998.
Dynamic generation of discrete random variates. Theory 814 of Computing Systems, vol.36, pp.329-358, 2003. ,
The iSLIP scheduling algorithm for input-queued switches, IEEE/ACM, vol.816 ,