Flowless: Extracting Densest Subgraphs Without Flow Computations (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Flowless: Extracting Densest Subgraphs Without Flow Computations

Award ID(s):: 1846218

NSF-PAR ID:: 10175443

Author(s) / Creator(s):: Boob, Digvijay; Gao, Yu; Peng, Richard; Sawlani, Saurabh; Tsourakakis, Charalampos; Wang, Di; Wang, Junxing

Date Published:: 2020-04-19

Journal Name:: WWW'20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020

Page Range / eLocation ID:: 573 to 583

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1145/3366423.3380140