Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time

MLA

Chen, Jianer, et al. Streaming Algorithms for Graph K-Matching with Optimal or Near-Optimal Update Time. 2023. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2310.10815&authtype=sso&custid=ns315887.

APA

Chen, J., Huang, Q., Kanj, I., Li, Q., & Xia, G. (2023). Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time.

Chicago

Chen, Jianer, Qin Huang, Iyad Kanj, Qian Li, and Ge Xia. 2023. “Streaming Algorithms for Graph K-Matching with Optimal or Near-Optimal Update Time.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2310.10815&authtype=sso&custid=ns315887.