当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
A distributed algorithm for finding Hamiltonian cycles in random graphs in O(logn) time
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-09-14 , DOI: 10.1016/j.tcs.2020.09.020 Volker Turau
中文翻译:
在随机图中查找哈密顿环的分布式算法。 时间
更新日期:2020-10-30
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-09-14 , DOI: 10.1016/j.tcs.2020.09.020 Volker Turau
It is known for some time that a random graph contains w.h.p. a Hamiltonian cycle if p is larger than the critical value . The determination of a concrete Hamiltonian cycle for is a nontrivial task, even when p is much larger than . In this paper we consider random graphs with p in , where hides poly-logarithmic factors in n. For this range of p we present a distributed algorithm that finds w.h.p. a Hamiltonian cycle in rounds. The algorithm works in the synchronous model and uses messages of size and memory per node.
中文翻译:
在随机图中查找哈密顿环的分布式算法。 时间
一段时间以来,人们都知道随机图 如果p大于临界值,则包含汉密尔顿周期。确定混凝土的哈密顿循环即使p大于。在本文中,我们考虑随机图用p in,在哪里 隐藏n中的多对数因子。对于p的这个范围,我们提出一种分布式算法 发现w在哈密顿周期 回合。该算法在同步模型中工作,并使用大小不一的消息 和 每个节点的内存。