Greedy approximation algorithms for finding dense components in a graph
From MaRDI portal
Recommendations
- Greedily Finding a Dense Subgraph
- Greedily finding a dense subgraph
- Approximation algorithms for approximating graphs with bounded number of connected components
- Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
- Approximation algorithms for graph approximation problems
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem
- Computational aspects of greedy partitioning of graphs
- On computational aspects of greedy partitioning of graphs
- Approximating edge dominating set in dense graphs
- Approximating edge dominating set in dense graphs
Cited in
(71)- Worst case analysis of a greedy algorithm for graph thickness
- Efficient and effective community search
- Top-\(k\) overlapping densest subgraphs
- The densest subgraph problem with a convex/concave size function
- Phase transition of the 2-choices dynamics on core-periphery networks
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- In search of the densest subgraph
- Regularity lemmas for clustering graphs
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
- Mining communities and their descriptions on attributed graphs: a survey
- Contention resolution, matrix scaling and fair allocation
- Computing the \(k\) densest subgraphs of a graph
- Discovering subjectively interesting multigraph patterns
- Fair-by-design matching
- Finding lasting dense subgraphs
- Finding densest \(k\)-connected subgraphs
- The complexity of detecting fixed-density clusters
- Chromatic kernel and its applications
- Finding dense subgraphs with maximum weighted triangle density
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Efficient primal-dual graph algorithms for MapReduce
- Fast approximation for computing the fractional arboricity and extraction of communities of a graph
- The densest k-subhypergraph problem
- Dense subgraphs in biological networks
- Parallel maximum clique algorithms with applications to network analysis
- Algorithms for the densest subgraph with at least \(k\) vertices and with a specified subset
- On Finding Dense Subgraphs
- Face recognition from caption-based supervision
- Greedily Finding a Dense Subgraph
- Test dense subgraphs in sparse uniform hypergraph
- On maximal cliques with connectivity constraints in directed graphs
- Fast algorithms for constrained graph density problems
- Density decompositions of networks
- Clustering as an approach to 3D reconstruction problem
- Finding a Dense-Core in Jellyfish Graphs
- Extracting brain disease‐related connectome subgraphs by adaptive dense subgraph discovery
- A unified view of graph regularity via matrix decompositions
- In search of dense subgraphs: How good is greedy peeling?
- Covering a graph with densest subgraphs
- Extracting densest sub-hypergraph with convex edge-weight functions
- A study on modularity density maximization: column generation acceleration and computational complexity analysis
- Auditing for core stability in participatory budgeting
- Mediation analysis for high-dimensional mediators and outcomes with an application to multimodal imaging data
- An efficient query recovery attack against a graph encryption scheme
- On integer linear programs for treewidth based on perfect elimination orderings
- OCSM: finding overlapping cohesive subgraphs with minimum degree
- Distributed dense subgraph detection and low outdegree orientation
- A multivariate to multivariate approach for voxel-wise genome-wide association analysis
- On approximating partial scenario set cover
- Covering a graph with densest subgraphs
- Planted models for the densest k-subgraph problem
- Polynomial pass semi-streaming lower bounds for k-cores and degeneracy
- Approximate cut \& packing ratios for multi-commodity arborescences
- Approximation algorithm for extracting densest subgraph over matching-like constraints
- Polyhedral aspects of feedback vertex set and pseudoforest deletion set
- Optirefine: densest subgraphs and maximum cuts with k refinements
- On the generalized mean densest subgraph problem: complexity and algorithms
- New lower bounds on the cutwidth of graphs
- On integer linear programs for treewidth based on perfect elimination orderings (extended version)
- Destroying densest subgraphs is hard
- Dense and sparse graph partition
- The strongish planted clique hypothesis and its consequences
- Locally computing edge orientations
- Engineering edge orientation algorithms
- Approximating densest subgraph in geometric intersection graphs
- Unraveling universally closest refinements via symmetric density decomposition and Fisher market equilibrium
- On deleting vertices to reduce density in graphs and supermodular functions
- Finding weighted k-truss communities in large networks
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems
- Randomized priority algorithms
- Modularity-maximizing graph communities via mathematical programming
This page was built for publication: Greedy approximation algorithms for finding dense components in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753729)
