Finding paths in sparse random graphs requires many queries-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Finding paths in sparse random graphs requires many queries

Published:2016-09-29 Issue:1 Volume:50 Page:71-85
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Ferber Asaf¹,Krivelevich Michael²,Sudakov Benny³,Vieira Pedro³

Affiliation:

1. Department of Mathematics; Yale University, and Department of Mathematics, MIT

2. School of Mathematical Sciences, Raymond and Beverly Sackler Faculty of Exact Sciences; Tel Aviv University; Tel Aviv 6997801 Israel

3. Department of Mathematics; ETH; 8092 Zurich Switzerland

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference15 articles.

1. Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees;Addario-Berry;Ann Probab,2013

2. The longest path in a random graph;Ajtai;Combinatorica,1981

3. The Probabilistic Method

4. Routing complexity of faulty networks;Angel;Random Struct Algorithms,2008

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the subgraph query problem;Combinatorics, Probability and Computing;2020-07-27

2. An Adversarial Model for Scheduling with Testing;Algorithmica;2020-07-10

3. Finding a planted clique by adaptive probing;Latin American Journal of Probability and Mathematical Statistics;2020

4. Finding cliques using few probes;Random Structures & Algorithms;2019-10-22

5. Online Ramsey Numbers and the Subgraph Query Problem;Bolyai Society Mathematical Studies;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP