On Finding Dense Subgraphs
From MaRDI portal
Publication:3638066
DOI10.1007/978-3-642-02927-1_50zbMath1248.68560OpenAlexW1500512125MaRDI QIDQ3638066
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_50
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Density (toughness, etc.) (05C42)
Related Items (36)
Chromatic kernel and its applications ⋮ Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis ⋮ Projection algorithms for nonconvex minimization with application to sparse principal component analysis ⋮ An extended edge-representative formulation for the \(K\)-partitioning problem ⋮ Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset ⋮ Test dense subgraphs in sparse uniform hypergraph ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ Finding connected \(k\)-subgraphs with high density ⋮ Finding dense subgraphs with maximum weighted triangle density ⋮ Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem ⋮ Finding Connected Dense $$k$$-Subgraphs ⋮ Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives ⋮ In search of dense subgraphs: How good is greedy peeling? ⋮ The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Covering a graph with densest subgraphs ⋮ Extracting densest sub-hypergraph with convex edge-weight functions ⋮ Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks ⋮ On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems ⋮ SQBC: an efficient subgraph matching method over large and dense graphs ⋮ Discovering subjectively interesting multigraph patterns ⋮ Finding lasting dense subgraphs ⋮ Exact algorithms for problems related to the densest \(k\)-set problem ⋮ On set expansion problems and the small set expansion conjecture ⋮ Finding densest \(k\)-connected subgraphs ⋮ Top-\(k\) overlapping densest subgraphs ⋮ Quantum solutions for densest \(k\)-subgraph problems ⋮ Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity ⋮ Graphs without a partition into two proportionally dense subgraphs ⋮ Community detection in dense random networks ⋮ Homophily outlier detection in non-IID categorical data ⋮ The densest subgraph problem with a convex/concave size function ⋮ On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation ⋮ Proportionally dense subgraph of maximum size: complexity and approximation ⋮ Computing the \(k\) densest subgraphs of a graph ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
This page was built for publication: On Finding Dense Subgraphs
