On the generalized mean densest subgraph problem: complexity and algorithms
From MaRDI portal
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- A general tractable density concept for graphs
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing the degeneracy of large graphs
- Convergence to lexicographically optimal base in a (contra)polymatroid and applications to densest subgraph and tree packing
- Densest subgraph: supermodularity, iterative peeling, and flow
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Efficient primal-dual graph algorithms for MapReduce
- Finding Dense Subgraphs with Size Bounds
- Greedily Finding a Dense Subgraph
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7788515 (Why is no real title available?)
- In search of the densest subgraph
- Losing Treewidth by Separating Subsets
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Maximum flow and minimum-cost flow in almost-linear time
- Non-approximability results for optimization problems on bounded degree instances
- The dense \(k\)-subgraph problem
- The densest subgraph problem with a convex/concave size function
This page was built for publication: On the generalized mean densest subgraph problem: complexity and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920837)
