TY - JOUR
T1 - Isomorphism for random k-uniform hypergraphs
AU - Chakraborti, Debsoumya
AU - Frieze, Alan
AU - Haber, Simi
AU - Hasabnis, Mihir
N1 - Publisher Copyright:
© 2020 The Author(s)
PY - 2021/2
Y1 - 2021/2
N2 - We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph Hn,p;k, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs Hn,r;k,r=O(1).
AB - We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random k-uniform hypergraph Hn,p;k, for a wide range of p. We also show that it is solvable w.h.p. for random r-regular, k-uniform hypergraphs Hn,r;k,r=O(1).
KW - Analysis of algorithms
KW - Isomorphism
KW - Random hypergraph
UR - http://www.scopus.com/inward/record.url?scp=85093658354&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2020.106039
DO - 10.1016/j.ipl.2020.106039
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85093658354
SN - 0020-0190
VL - 166
JO - Information Processing Letters
JF - Information Processing Letters
M1 - 106039
ER -