Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
DOI10.1016/J.DAM.2011.08.024zbMATH Open1237.68071OpenAlexW2106305892MaRDI QIDQ765344FDOQ765344
Authors: Yeow Meng Chee, Lijun Ji, Anthony K. H. Tung, Andrew Lim 
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.024
Recommendations
arboricitypackingSteiner triple systemacyclic hypergraphSteiner quadruple systemhypergraph decompositionacyclic database schema
Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Database theory (68P15) Triple systems (05B07)
Cites Work
- On a packing and covering problem
- On Quadruple Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- A simplied universal relation assumption and its properties
- Title not available (Why is that?)
- Degrees of acyclicity for hypergraphs and relational database schemes
- Syntactic Characterization of Tree Database Schemas
- On the spanning tree packing number of a graph: A survey
- Enumeration of maximum acyclic hypergraphs
- The \(\alpha \)-arboricity of complete uniform hypergraphs
- Steiner systems 𝑆(5,6,𝑣) with 𝑣=72 and 84
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
Cited In (2)
This page was built for publication: Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765344)
