Finding a Dense-Core in Jellyfish Graphs
From MaRDI portal
Recommendations
Cites work
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
- A geographic directed preferential internet topology model
- A local-world evolving network model
- A new conceptual clustering framework
- Approximation algorithms for maximization problems arising in graph partitioning
- Attack resistance of power-law random graphs in the finite-mean, infinite-variance region
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Finding a Dense-Core in Jellyfish Graphs
- Greedily Finding a Dense Subgraph
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- Property testing and its connection to learning and approximation
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- The dense \(k\)-subgraph problem
Cited in
(4)
This page was built for publication: Finding a Dense-Core in Jellyfish Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458298)