Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/jgt/BalBBF18
%A Bal, Deepak
%A Bennett, Patrick
%A Bohman, Tom
%A Frieze, Alan M.
%D 2018
%J J. Graph Theory
%K dblp
%N 3
%P 449-481
%T A greedy algorithm for finding a large 2-matching on a random cubic graph.
%U http://dblp.uni-trier.de/db/journals/jgt/jgt88.html#BalBBF18
%V 88
@article{journals/jgt/BalBBF18,
added-at = {2023-09-30T00:00:00.000+0200},
author = {Bal, Deepak and Bennett, Patrick and Bohman, Tom and Frieze, Alan M.},
biburl = {https://www.bibsonomy.org/bibtex/298cac47522e6518af7409d9e52575c3f/dblp},
ee = {https://doi.org/10.1002/jgt.22224},
interhash = {d7917f05d48e5b44586ede4b7cda8968},
intrahash = {98cac47522e6518af7409d9e52575c3f},
journal = {J. Graph Theory},
keywords = {dblp},
number = 3,
pages = {449-481},
timestamp = {2024-04-09T07:37:35.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/jgt/jgt88.html#BalBBF18},
volume = 88,
year = 2018
}