Covering a graph with densest subgraphs

DOI10.1007/978-3-030-95018-7_13MaRDI QIDQ6102273zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Fast Parametric Maximum Flow Algorithm and Applications
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Complexity of finding dense subgraphs
• Covering a graph with clubs
• Finding Dense Subgraphs with Size Bounds
• Finding disjoint dense clubs in a social network
• Generating Sparse 2-Spanners
• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• Multivariate algorithmics for finding cohesive subnetworks
• On Finding Dense Subgraphs
• Reducibility among combinatorial problems
• The densest subgraph problem with a convex/concave size function
• Top-\(k\) overlapping densest subgraphs
• Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity

Cited in

(5)

• Dumbbell graphs with extremal (reverse) cover cost
• Sandwiching a densest subgraph by consecutive cores
• Connected Vertex Covers in Dense Graphs
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
• Dense graph partitioning on sparse and dense graphs

This page was built for publication: Covering a graph with densest subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102273)