Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Dense Subgraph Discovery"”.

  1. Combining combinatorial and LP-based methods for better and faster approximation algorithms

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms

    uiuc Repository record for Combining combinatorial and LP-based methods for better and faster approximation algorithms (opens in a new tab)

  2. Statistical inference on network data

    … of those networks. The problem of finding densely connected subgraphs in a network has attracted a lot of recent attention. Such subgraphs are sometimes referred to as communities in social networks or molecular modules in protein networks. In Chapter 4, we propose two Monte Carlo …

    uiuc Repository record for Statistical inference on network data (opens in a new tab)