当前位置:
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Isomorphism for random k-uniform hypergraphs
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-10-19 , DOI: 10.1016/j.ipl.2020.106039 Debsoumya Chakraborti , Alan Frieze , Simi Haber , Mihir Hasabnis
中文翻译:
随机k-一致超图的同构
更新日期:2020-12-04
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-10-19 , DOI: 10.1016/j.ipl.2020.106039 Debsoumya Chakraborti , Alan Frieze , Simi Haber , Mihir Hasabnis
We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph , for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs .
中文翻译:
随机k-一致超图的同构
我们研究随机超图的同构问题。我们证明对于二项式随机k-一致超图它在多项式时间内是可解的,适用于广泛的p。我们还表明对于随机r-正则,k-统一超图它是可解决的。