Arboricity : an acyclic hypergraph decomposition problem motivated by database theory

• المؤلفون الرئيسيون: Chee, Yeow Meng, Ji, Lijun, Lim, Andrew, Tung, Anthony K. H.
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2013
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/99517; http://hdl.handle.net/10220/10864

The arboricity of a hypergraph HH is the minimum number of acyclic hypergraphs that partition HH. The determination of the arboricity of hypergraphs is a problem motivated by database theory. The exact arboricity of the complete kk-uniform hypergraph of order nn is previously known only for k∈{1,2,n...