%0 Journal Article %1 DBLP:journals/networks/PastukhovVBP18 %A Pastukhov, Grigory %A Veremyev, Alexander %A Boginski, Vladimir %A Prokopyev, Oleg A. %D 2018 %J Networks %K approximation quasi-clique %N 2 %P 136--152 %R 10.1002/net.21791 %T On maximum degree-based \(\gamma\)-quasi-clique problem: Complexity and exact approaches %U https://doi.org/10.1002/net.21791 %V 71

@article{DBLP:journals/networks/PastukhovVBP18, added-at = {2018-09-14T17:19:54.000+0200}, author = {Pastukhov, Grigory and Veremyev, Alexander and Boginski, Vladimir and Prokopyev, Oleg A.}, bibsource = {dblp computer science bibliography, https://dblp.org}, biburl = {https://www.bibsonomy.org/bibtex/2270199b878883f9949baef0eb920a4c7/prathyush}, doi = {10.1002/net.21791}, interhash = {c4761239be4e84220c54ec90294ca210}, intrahash = {270199b878883f9949baef0eb920a4c7}, journal = {Networks}, keywords = {approximation quasi-clique}, number = 2, pages = {136--152}, timestamp = {2018-09-14T17:19:54.000+0200}, title = {On maximum degree-based {\(\gamma\)}-quasi-clique problem: Complexity and exact approaches}, url = {https://doi.org/10.1002/net.21791}, volume = 71, year = 2018 }