APA (7th ed.) Citation

Azad, A., & Buluç, A. (2016). A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs. Parallel computing, 58(C), 117-130. https://doi.org/10.1016/j.parco.2016.05.007

Chicago Style (17th ed.) Citation

Azad, Ariful, and Aydın Buluç. "A Matrix-algebraic Formulation of Distributed-memory Maximal Cardinality Matching Algorithms in Bipartite Graphs." Parallel Computing 58, no. C (2016): 117-130. https://doi.org/10.1016/j.parco.2016.05.007.

MLA (9th ed.) Citation

Azad, Ariful, and Aydın Buluç. "A Matrix-algebraic Formulation of Distributed-memory Maximal Cardinality Matching Algorithms in Bipartite Graphs." Parallel Computing, vol. 58, no. C, 2016, pp. 117-130, https://doi.org/10.1016/j.parco.2016.05.007.