General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. Proceedings of the 23rd ACM Conference on Economics and Computation. https://doi.org/10.1145/3490486.3538290
Chicago Style (17th ed.) Citation"General Graphs Are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching." Proceedings of the 23rd ACM Conference on Economics and Computation . https://doi.org/10.1145/3490486.3538290.
MLA (9th ed.) Citation"General Graphs Are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching." Proceedings of the 23rd ACM Conference on Economics and Computation, , https://doi.org/10.1145/3490486.3538290.
Warning: These citations may not always be 100% accurate.