Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs

Pattara Sukprasert, Quanquan Liu

Explore Research Products in the NSF-PAR

+ Advanced Search

Citation Details

Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs

Award ID(s):: 1845763

NSF-PAR ID:: 10491580

Author(s) / Creator(s):: Pattara Sukprasert, Quanquan Liu

Publisher / Repository:: SIAM

Date Published:: 2024-01-07

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Conference Paper:
The DOI is not currently available.

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this