Finding a Hidden Edge

Ron Kupfer, Noam Nisan

Type: Preprint

Publication Date: 2022-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2207.02344

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Learning Low Degree Hypergraphs	2022	Eric Balkanski Oussama Hanguir Shatian Wang
+ PDF Chat	Lower bounds for graph reconstruction with maximal independent set queries	2024	Lukas Michel Alex Scott
+	Finding a planted clique by adaptive probing	2020	Miklós Z. Rácz Benjamin Schiffer
+	Finding a planted clique by adaptive probing	2019	Miklós Z. Rácz Benjamin Schiffer
+	Finding a planted clique by adaptive probing	2019	Miklós Z. Rácz Benjamin Schiffer
+	Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries	2022	Raghavendra Addanki Andrew McGregor Cameron Musco
+	Finding cliques and dense subgraphs using edge queries	2023	Endre Csóka András Pongrácz
+	Non-Adaptive Learning a Hidden Hipergraph	2015	Hasan Abasi Nader H. Bshouty Hanna Mazzawi
+	Non-Adaptive Learning a Hidden Hipergraph	2015	Hasan Abasi Nader H. Bshouty Hanna Mazzawi
+	Learning a Hidden Matching Combinatorial Identification of Hidden Matchings with Applications to Whole Genome Sequencing	2002	Noga Alon Richard Beigel Simon Kasif Steven Rudich Benny Sudakov
+	Graph Reconstruction via MIS Queries	2024	Christian Konrad Conor O’Sullivan Victor Traistaru
+	Random Subgraph Detection Using Queries	2021	Wasim Huleihel Arya Mazumdar Soumyabrata Pal
+ PDF Chat	Network Discovery and Verification	2005	Zuzana Beerliová Felix Eberhard Thomas Erlebach Alexander Hall Michael M. Hoffmann Matúš Mihaľák L. Shankar Ram
+	Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time	2014	Yash Deshpande Andrea Montanari
+	A Framework for Searching in Graphs in the Presence of Errors	2018	Dariusz Dereniowski Stefan Tiegel Przemysław Uznański Daniel Wolleb-Graf
+	On Learning Graphs with Edge-Detecting Queries	2018	Hasan Abasi Nader H. Bshouty
+	A tight bound for the clique query problem in two rounds	2021	Uriel Feige Tom Ferster
+	Near-Linear Query Complexity for Graph Inference	2014	Sampath Kannan Claire Mathieu Hang Zhou
+	A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling	2018	Sepehr Assadi Michael Kapralov Sanjeev Khanna
+	A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling	2018	Sepehr Assadi Michael Kapralov Sanjeev Khanna

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors