Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Learning and verifying graphs using queries with a focus on edge counting
L Reyzin, N Srivastava - … Theory: 18th International Conference, ALT 2007 …, 2007 - Springer
We consider the problem of learning and verifying hidden graphs and their properties given
query access to the graphs. We analyze various queries (edge detection, edge counting …
query access to the graphs. We analyze various queries (edge detection, edge counting …
Robust multi-source network tomography using selective probes
Knowledge of a network's topology and internal characteristics such as delay times or losses
is crucial to maintain seamless operation of network services. Network tomography is a …
is crucial to maintain seamless operation of network services. Network tomography is a …
Graph reconstruction and verification
How efficiently can we find an unknown graph using distance or shortest path queries
between its vertices? We assume that the unknown graph G is connected, unweighted, and …
between its vertices? We assume that the unknown graph G is connected, unweighted, and …
Topology discovery of sparse random graphs with few participants
We consider the task of topology discovery of sparse random graphs using end-to-end
random measurements (eg, delay) between a subset of nodes, referred to as the …
random measurements (eg, delay) between a subset of nodes, referred to as the …
Reconstructing biological and digital phylogenetic trees in parallel
R Afshar, MT Goodrich, P Matias… - ar** algorithms
Motivated from parallel network map**, we provide efficient query complexity and round
complexity bounds for graph reconstruction using distance queries, including a bound that …
complexity bounds for graph reconstruction using distance queries, including a bound that …
Exact learning of multitrees and almost-trees using path queries
R Afshar, MT Goodrich - Latin American Symposium on Theoretical …, 2022 - Springer
Given a directed graph, G=(V, E), a path query, path (u, v), returns whether there is a
directed path from u to v in G, for u, v∈ V. Given only V, exactly learning all the edges in G …
directed path from u to v in G, for u, v∈ V. Given only V, exactly learning all the edges in G …
Graph reconstruction via distance oracles
C Mathieu, H Zhou - International Colloquium on Automata, Languages …, 2013 - Springer
We study the problem of reconstructing a hidden graph given access to a distance oracle.
We design randomized algorithms for the following problems: reconstruction of a degree …
We design randomized algorithms for the following problems: reconstruction of a degree …