Finding Subgraphs with Maximum Total Density and Limited Overlap.

Oana Denisa Balalau|Francesco Bonchi|T.-H. Hubert Chan|Francesco Gullo|Mauro Sozio


Anthology ID:DBLP:conf/wsdm/BalalauBCGS15
Volume:Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, WSDM 2015, Shanghai, China, February 2-6, 2015
Year:2015
Venue:Web Search and Data Mining (WSDM)
Publisher:ACM
Pages:379-388
URL:https://doi.org/10.1145/2684822.2685298
DOI:https://doi.org/10.1145/2684822.2685298
DBLP:conf/wsdm/BalalauBCGS15
BibTeX:
@inproceedings{balalau-2015-finding, author = {Oana Denisa Balalau and Francesco Bonchi and T.-H. Hubert Chan and Francesco Gullo and Mauro Sozio}, editor = {Xueqi Cheng and Hang Li and Evgeniy Gabrilovich and Jie Tang}, title = {{Finding Subgraphs with Maximum Total Density and Limited Overlap}}, booktitle = {{Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, WSDM 2015, Shanghai, China, February 2-6, 2015}}, pages = {379--388}, publisher = {ACM}, year = {2015}, url = {https://doi.org/10.1145/2684822.2685298}, doi = {https://doi.org/10.1145/2684822.2685298} }