scientific article
From MaRDI portal
Publication:2959905
zbMath1355.05186MaRDI QIDQ2959905
Publication date: 10 February 2017
Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0114
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (17)
Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Optimal detection of sparse principal components in high dimension ⋮ A simple spectral algorithm for recovering planted partitions ⋮ Community detection in sparse random networks ⋮ Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation ⋮ Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time ⋮ A Simple SVD Algorithm for Finding Hidden Partitions ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log*|V|) time ⋮ On the hardness of designing public signals ⋮ Community detection in dense random networks ⋮ Finding a planted clique by adaptive probing ⋮ Convex optimization for the densest subgraph and densest submatrix problems ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs ⋮ Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning ⋮ Computational barriers in minimax submatrix detection ⋮ Do semidefinite relaxations solve sparse PCA up to the information limit?
This page was built for publication:
