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.
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
{"_id":"BnDxsn7d4qz7QmZG7","bibbaseid":"bal-bennett-bohman-frieze-agreedyalgorithmforfindingalarge2matchingonarandomcubicgraph-2012","downloads":0,"creationDate":"2016-04-26T11:47:38.486Z","title":"A greedy algorithm for finding a large 2-matching on a random cubic graph","author_short":["Bal, D.","Bennett, P.","Bohman, T.","Frieze, A. M."],"year":2012,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/tom?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2018-08-13T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Bal"],"firstnames":["Deepak"],"suffixes":[]},{"propositions":[],"lastnames":["Bennett"],"firstnames":["Patrick"],"suffixes":[]},{"propositions":[],"lastnames":["Bohman"],"firstnames":["Tom"],"suffixes":[]},{"propositions":[],"lastnames":["Frieze"],"firstnames":["Alan","M."],"suffixes":[]}],"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","bibtex":"@article{journals/corr/abs-1209-6570,\n added-at = {2018-08-13T00:00:00.000+0200},\n author = {Bal, Deepak and Bennett, Patrick and Bohman, Tom and Frieze, Alan M.},\n biburl = {https://www.bibsonomy.org/bibtex/28b670ea9d5d6ecedffe62243e28e68af/dblp},\n ee = {http://arxiv.org/abs/1209.6570},\n interhash = {2560771169f1e1cab355b459f2152d0e},\n intrahash = {8b670ea9d5d6ecedffe62243e28e68af},\n journal = {CoRR},\n keywords = {dblp},\n timestamp = {2018-08-14T15:12:39.000+0200},\n title = {A greedy algorithm for finding a large 2-matching on a random cubic graph},\n url = {http://dblp.uni-trier.de/db/journals/corr/corr1209.html#abs-1209-6570},\n volume = {abs/1209.6570},\n year = 2012\n}\n\n","author_short":["Bal, D.","Bennett, P.","Bohman, T.","Frieze, A. M."],"key":"journals/corr/abs-1209-6570","id":"journals/corr/abs-1209-6570","bibbaseid":"bal-bennett-bohman-frieze-agreedyalgorithmforfindingalarge2matchingonarandomcubicgraph-2012","role":"author","urls":{"Link":"http://arxiv.org/abs/1209.6570","Paper":"http://dblp.uni-trier.de/db/journals/corr/corr1209.html#abs-1209-6570"},"keyword":["dblp"],"downloads":0},"search_terms":["greedy","algorithm","finding","large","matching","random","cubic","graph","bal","bennett","bohman","frieze"],"keywords":["dblp"],"authorIDs":[],"dataSources":["NyBbkYhtYKHg8fY2r"]}