Cite
HARVARD Citation
Bal, D. et al. (2018). A greedy algorithm for finding a large 2‐matching on a random cubic graph. Journal of graph theory. 88 (3), pp. 449-481. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Bal, D. et al. (2018). A greedy algorithm for finding a large 2‐matching on a random cubic graph. Journal of graph theory. 88 (3), pp. 449-481. [Online].