We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is defined for investigating the performance of a simple algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for edge probability of random 3-uniform hypergraphs such that the propagation connectivity holds. Based on our analysis, we also show the way to implement the simple algorithm so that it runs in linear time on average.
机构:
Cent China Normal Univ, Sch Math & Stat, Wuhan, Peoples R ChinaCent China Normal Univ, Sch Math & Stat, Wuhan, Peoples R China
Ding, Laihao
Han, Jie
论文数: 0引用数: 0
h-index: 0
机构:
Beijing Inst Technol, Ctr Appl Math, Sch Math & Stat, Beijing, Peoples R ChinaCent China Normal Univ, Sch Math & Stat, Wuhan, Peoples R China
Han, Jie
Sun, Shumin
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Univ, Sch Math, Jinan, Peoples R ChinaCent China Normal Univ, Sch Math & Stat, Wuhan, Peoples R China
Sun, Shumin
Wang, Guanghui
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Univ, Sch Math, Jinan, Peoples R ChinaCent China Normal Univ, Sch Math & Stat, Wuhan, Peoples R China
Wang, Guanghui
Zhou, Wenling
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Univ, Sch Math, Jinan, Peoples R China
Univ Paris Saclay, Lab Interdisciplinaire Sci Numer, CNRS, Orsay, FranceCent China Normal Univ, Sch Math & Stat, Wuhan, Peoples R China
机构:
Eotvos Lorand Univ, Inst Math, Budapest, Hungary
Hungarian Acad Sci, Numer Anal & Large Networks Res Grp, Budapest, HungaryEotvos Lorand Univ, Inst Math, Budapest, Hungary
Bodo, Agnes
Katona, Gyula Y.
论文数: 0引用数: 0
h-index: 0
机构:
Hungarian Acad Sci, Numer Anal & Large Networks Res Grp, Budapest, Hungary
Budapest Univ Technol & Econ, Dept Comp Sci & Informat Theory, Budapest, HungaryEotvos Lorand Univ, Inst Math, Budapest, Hungary
Katona, Gyula Y.
Simon, Peter L.
论文数: 0引用数: 0
h-index: 0
机构:
Eotvos Lorand Univ, Inst Math, Budapest, Hungary
Hungarian Acad Sci, Numer Anal & Large Networks Res Grp, Budapest, HungaryEotvos Lorand Univ, Inst Math, Budapest, Hungary