Research map / Graph learning / Graph algorithms and clustering
Found Graph Data and Planted Vertex Covers
Austin R Benson, Jon Kleinberg
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the union of repeatedly sampled minimal vertex covers, ranked by degree | Core recovery with UMVC · Five real-world datasets | precision at core size and AUPRC | Improved |
| Use UMVC instead of belief propagation | Core recovery · email-Eu | precision at core size and AUPRC | Improved |
| Use UMVC instead of belief propagation | Core recovery · email-W3C and other datasets | precision at core size and AUPRC | Mixed |
| Use UMVC instead of belief propagation | Full-dataset algorithm runtime · email-W3C | runtime: 6.5 secs vs 1.0 mins | Improved |
| Use UMVC instead of belief propagation | Full-dataset algorithm runtime · email-Enron | runtime: 8.4 secs vs 20.2 mins | Improved |
| Use UMVC instead of belief propagation | Full-dataset algorithm runtime · email-Eu | runtime: 1.2 mins vs 15.0 mins | Improved |
| Use UMVC instead of belief propagation | Full-dataset algorithm runtime · call-Reality | runtime: 2.2 secs vs 4.3 secs | Improved |
| Use UMVC instead of belief propagation | Full-dataset algorithm runtime · text-Reality | runtime: 0.5 secs vs 6.8 secs | Improved |
| Use 300 minimal vertex covers | UMVC · Real-world datasets | runtime and recovery performance | Mixed |
Closest papers by meaning
- Random Subgraph Detection Using Queries (JMLR 2024 · similarity 0.82)
- Coresets for Clustering in Graphs of Bounded Treewidth (ICML 2020 · similarity 0.82)
- Limited Query Graph Connectivity Test (AAAI 2024 · similarity 0.80)
- TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphs (NeurIPS 2024 · similarity 0.80)
- Approximating Optimal Labelings for Temporal Connectivity (AAAI 2025 · similarity 0.79)
- Sum-Product-Set Networks: Deep Tractable Models for Tree-Structured Graphs (ICLR 2024 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
