Covering a graph with densest subgraphs
From MaRDI portal
Publication:6102273
DOI10.1007/978-3-030-95018-7_13OpenAlexW4206933841MaRDI QIDQ6102273
No author found.
Publication date: 8 May 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-95018-7_13
Cites Work
- Unnamed Item
- Complexity of finding dense subgraphs
- Multivariate algorithmics for finding cohesive subnetworks
- Top-\(k\) overlapping densest subgraphs
- The densest subgraph problem with a convex/concave size function
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
- Finding disjoint dense clubs in a social network
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Finding Dense Subgraphs with Size Bounds
- On Finding Dense Subgraphs
- Generating Sparse 2-Spanners
- A Fast Parametric Maximum Flow Algorithm and Applications
- Reducibility among Combinatorial Problems
- Covering a Graph with Clubs
This page was built for publication: Covering a graph with densest subgraphs
