Chapter 6. Local density
From MaRDI portal
Cited in
(9)- Multivariate algorithmics for finding cohesive subnetworks
- In search of the densest subgraph
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Inequalities for the number of walks in graphs
- Matrix power inequalities and the number of walks in graphs
- Editing graphs into disjoint unions of dense clusters
- Solving the multiobjective quasi-clique problem
- The self-consistent determination of HF electroconductivity of strongly coupled plasmas
- Isolation concepts for efficiently enumerating dense subgraphs
This page was built for publication: Chapter 6. Local density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703981)