Arboricity : an acyclic hypergraph decomposition problem motivated by database theory
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...
Saved in:
Main Authors: | Chee, Yeow Meng, Ji, Lijun, Lim, Andrew, Tung, Anthony K. H. |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2013
|
在線閱讀: | https://hdl.handle.net/10356/99517 http://hdl.handle.net/10220/10864 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
由: Chee, Y.M., et al.
出版: (2013) -
Hamiltonian decompositions of hypergraphs
由: Chutima Saengchampa
出版: (2021) -
Hamiltonian Decompositions of Some Hypergraphs
由: Sansanee Termtanasombat
出版: (2014) -
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
由: Bryant,D.E., et al.
出版: (2015) -
ACYCLIC DOMINATION
由: GRACE LEE YAN LING
出版: (2021)