Large Scale Density-friendly Graph Decomposition via Convex Programming.
Maximilien Danisch|T.-H. Hubert Chan|Mauro Sozio
| Anthology ID: | DBLP:conf/www/DanischCS17 |
|---|---|
| Volume: | Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017 |
| Year: | 2017 |
| Venue: | The Web Conference (WWW) |
| Publisher: | ACM |
| Pages: | 233-242 |
| URL: | https://doi.org/10.1145/3038912.3052619 |
| DOI: | https://doi.org/10.1145/3038912.3052619 |
| DBLP: | conf/www/DanischCS17 |
| BibTeX: |
@inproceedings{danisch-2017-large,
author = {Maximilien Danisch and
T.-H. Hubert Chan and
Mauro Sozio},
editor = {Rick Barrett and
Rick Cummings and
Eugene Agichtein and
Evgeniy Gabrilovich},
title = {{Large Scale Density-friendly Graph Decomposition via Convex Programming}},
booktitle = {{Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017}},
pages = {233--242},
publisher = {ACM},
year = {2017},
url = {https://doi.org/10.1145/3038912.3052619},
doi = {https://doi.org/10.1145/3038912.3052619}
}