Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
- 13 October 2011
- journal article
- research article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 160 (1-2), 100-107
- https://doi.org/10.1016/j.dam.2011.08.024
Abstract
No abstract availableKeywords
Funding Information
- National Research Foundation of Singapore (NRF-CRP2-2007-03)
- Nanyang Technological University (M58110040)
- NSFC (10701060, 10831002)
This publication has 14 references indexed in Scilit:
- The α-Arboricity of Complete Uniform HypergraphsSIAM Journal on Discrete Mathematics, 2011
- Enumeration of Maximum Acyclic HypergraphsActa Mathematicae Applicatae Sinica, English Series, 2002
- On the spanning tree packing number of a graph: a surveyDiscrete Mathematics, 2001
- TRIPLE SYSTEMS (Oxford Mathematical Monographs)Bulletin of the London Mathematical Society, 2000
- Steiner systems 𝑆(5,6,𝑣) with 𝑣=72 and 84Mathematics of Computation, 1998
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983
- A simplied universal relation assumption and its propertiesACM Transactions on Database Systems, 1982
- GRAPHS AND HYPERGRAPHSBulletin of the London Mathematical Society, 1974