Finding Hamilton cycles in random graphs with few queries-Reference-Cited by-同舟云学术

Finding Hamilton cycles in random graphs with few queries

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

Funder

USA-Israel BSF (to M.K.)

Israel Science Foundation (to M.K.)

SNSF (to B.S.)

Publisher

Wiley

Subject

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

Reference17 articles.

2. Hamilton cycles in 3-out;Bohman;Random Struct Algorithms,2009

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

1. Concatenated Nanopore DNA Codes;IEEE Transactions on NanoBioscience;2024-04

2. Solving the Hamilton cycle problem fast on average;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

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