Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang. New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. Algorithmica, 80(2):652-667, 2018. [doi]
@article{BravermanLSVY18,
title = {New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory},
author = {Vladimir Braverman and Zaoxing Liu and Tejasvam Singh and N. V. Vinodchandran and Lin F. Yang},
year = {2018},
doi = {10.1007/s00453-017-0277-5},
url = {https://doi.org/10.1007/s00453-017-0277-5},
researchr = {https://researchr.org/publication/BravermanLSVY18},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {652-667},
}