Finding planted cycles in a random graph
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3916307 (Why is no real title available?)
- scientific article; zbMATH DE number 3574966 (Why is no real title available?)
- scientific article; zbMATH DE number 1380608 (Why is no real title available?)
- scientific article; zbMATH DE number 3249675 (Why is no real title available?)
- A nearly tight sum-of-squares lower bound for the planted clique problem
- A note on long cycles in sparse random graphs
- A scaling limit for the length of the longest cycle in a sparse random graph
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- Expected complexity of graph partitioning problems
- Information-theoretic thresholds for planted dense cycles
- Large Cliques Elude the Metropolis Process
- Long paths and cycles in random subgraphs of graphs with large minimum degree
- On large matchings and cycles in sparse random graphs
- Random graph dynamics
- Settling the Sharp Reconstruction Thresholds of Random Graph Matching
- The all-or-nothing phenomenon in sparse linear regression
- The planted matching problem: phase transitions and exact results
- The planted matching problem: sharp threshold and infinite-order phase transition
This page was built for publication: Finding planted cycles in a random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240417)
