P. Lee, und L. Lakshmanan. Proceedings of the 2016 SIAM International Conference on Data Mining, Miami, Florida, USA, May 5-7, 2016, Seite 522--530. (2016)
DOI: 10.1137/1.9781611974348.59
Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 DBLP:conf/sdm/LeeL16
%A Lee, Pei
%A Lakshmanan, Laks V. S.
%B Proceedings of the 2016 SIAM International Conference on Data Mining, Miami, Florida, USA, May 5-7, 2016
%D 2016
%K algorithms approximation quasi-clique
%P 522--530
%R 10.1137/1.9781611974348.59
%T Query-Driven Maximum Quasi-Clique Search
%U https://doi.org/10.1137/1.9781611974348.59
@inproceedings{DBLP:conf/sdm/LeeL16,
added-at = {2018-09-14T17:04:09.000+0200},
author = {Lee, Pei and Lakshmanan, Laks V. S.},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://www.bibsonomy.org/bibtex/2961edf3621eb8b56396cbf6e70d95bc0/prathyush},
booktitle = {Proceedings of the 2016 {SIAM} International Conference on Data Mining, Miami, Florida, USA, May 5-7, 2016},
crossref = {DBLP:conf/sdm/2016},
doi = {10.1137/1.9781611974348.59},
interhash = {1e386b14e3d085e630a30ec739e58f20},
intrahash = {961edf3621eb8b56396cbf6e70d95bc0},
keywords = {algorithms approximation quasi-clique},
pages = {522--530},
timestamp = {2018-09-14T17:04:09.000+0200},
title = {Query-Driven Maximum Quasi-Clique Search},
url = {https://doi.org/10.1137/1.9781611974348.59},
year = 2016
}
