A greedy algorithm for finding a large 2-matching on a random cubic graph. Bal, D., Bennett, P., Bohman, T., & Frieze, A. M. CoRR, 2012.
A greedy algorithm for finding a large 2-matching on a random cubic graph [link]Link  A greedy algorithm for finding a large 2-matching on a random cubic graph [link]Paper  bibtex   
@article{journals/corr/abs-1209-6570,
  added-at = {2018-08-13T00:00:00.000+0200},
  author = {Bal, Deepak and Bennett, Patrick and Bohman, Tom and Frieze, Alan M.},
  biburl = {https://www.bibsonomy.org/bibtex/28b670ea9d5d6ecedffe62243e28e68af/dblp},
  ee = {http://arxiv.org/abs/1209.6570},
  interhash = {2560771169f1e1cab355b459f2152d0e},
  intrahash = {8b670ea9d5d6ecedffe62243e28e68af},
  journal = {CoRR},
  keywords = {dblp},
  timestamp = {2018-08-14T15:12:39.000+0200},
  title = {A greedy algorithm for finding a large 2-matching on a random cubic graph},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1209.html#abs-1209-6570},
  volume = {abs/1209.6570},
  year = 2012
}

Downloads: 0