ACM World Wide Web, WWW 2017


Article Details
Title: Large Scale Density-friendly Graph Decomposition via Convex Programming
Article URLs:
Alternative Article URLs:
Authors: Maximilien Danisch
  • Université Paris-Saclay, LTCI
  • Université Paris-Saclay, Télécom ParisTech
T.-H. Hubert Chan
  • University of Hong Kong, Department of Computer Science
Mauro Sozio
  • Université Paris-Saclay, LTCI
  • Université Paris-Saclay, Télécom ParisTech
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/www/DanischCS17
Author Comments:

Discuss this paper and its artifacts below