Test dense subgraphs in sparse uniform hypergraph
From MaRDI portal
Publication:5079097
Recommendations
- Testing for dense subsets in a graph via the partition function
- Testing subgraphs in large graphs
- Testing subgraphs in directed graphs
- Testing subgraphs in directed graphs
- scientific article; zbMATH DE number 2086691
- Sharp detection boundaries on testing dense subhypergraph
- Testing first-order properties for subclasses of sparse graphs
- Finding dense subgraphs of sparse graphs
- Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
- Algorithmic aspects of property testing in the dense graphs model
Cites work
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- A survey of statistical network models
- Community detection and stochastic block models: recent developments
- Community detection in dense random networks
- Community detection in sparse random networks
- Consistency of spectral hypergraph partitioning under planted partition model
- Finding Dense Subgraphs with Size Bounds
- On Finding Dense Subgraphs
- Recovering a hidden community beyond the Kesten-Stigum threshold in \(O(| E|\log^\ast| V|)\) time
- The Ramsey number of generalized loose paths in hypergraphs
- The densest \(k\)-subhypergraph problem
Cited in
(2)
This page was built for publication: Test dense subgraphs in sparse uniform hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079097)
