Finding Subgraphs with Maximum Total Density and Limited Overlap - Archive ouverte HAL Access content directly
Conference Papers Year :
Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-01699040 , version 1

Cite

Mauro Sozio, Oana Balalau, Francesco Bonchi, T-H. Hubert Chan, Francesco Gullo. Finding Subgraphs with Maximum Total Density and Limited Overlap. Web Search and Data Mining (WSDM), 2015, Shanghai, China. ⟨hal-01699040⟩
175 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More