Cite
Approximating maximum uniquely restricted matchings in bipartite graphs.
MLA
Baste, Julien, et al. “Approximating Maximum Uniquely Restricted Matchings in Bipartite Graphs.” Discrete Applied Mathematics, vol. 267, Aug. 2019, pp. 30–40. EBSCOhost, https://doi.org/10.1016/j.dam.2019.04.024.
APA
Baste, J., Rautenbach, D., & Sau, I. (2019). Approximating maximum uniquely restricted matchings in bipartite graphs. Discrete Applied Mathematics, 267, 30–40. https://doi.org/10.1016/j.dam.2019.04.024
Chicago
Baste, Julien, Dieter Rautenbach, and Ignasi Sau. 2019. “Approximating Maximum Uniquely Restricted Matchings in Bipartite Graphs.” Discrete Applied Mathematics 267 (August): 30–40. doi:10.1016/j.dam.2019.04.024.