Large Scale Density-friendly Graph Decomposition via Convex Programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Large Scale Density-friendly Graph Decomposition via Convex Programming

Not file

Dates and versions

hal-01699048 , version 1 (01-02-2018)

Identifiers

  • HAL Id : hal-01699048 , version 1

Cite

Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio. Large Scale Density-friendly Graph Decomposition via Convex Programming. WWW, 2017, Perth, Australia. ⟨hal-01699048⟩
54 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More