[1]
Gelle, K. and Iván, S. 2018. DFS is Unsparsable and Lookahead Can Help in Maximal Matching. Acta Cybernetica. 23, 3 (Jan. 2018), 887-902. DOI:https://doi.org/10.14232/actacyb.23.3.2018.10.