Arboricity: an acyclic hypergraph decomposition problem motivated by database theory

DOI10.1016/j.dam.2011.08.024zbMath1237.68071OpenAlexW2106305892MaRDI QIDQ765344

Yeow Meng Chee, Anthony K. H. Tung, Lijun Ji, Andrew E. B. 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

zbMATH Keywords

Steiner triple systempackingSteiner quadruple systemarboricityacyclic hypergraphhypergraph decompositionacyclic database schema

Mathematics Subject Classification ID

Database theory (68P15) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Triple systems (05B07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• Enumeration of maximum acyclic hypergraphs
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Syntactic Characterization of Tree Database Schemas
• The α-Arboricity of Complete Uniform Hypergraphs
• On Quadruple Systems
• 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
• Steiner systems 𝑆(5,6,𝑣) with 𝑣=72 and 84
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• On the spanning tree packing number of a graph: A survey

This page was built for publication: Arboricity: an acyclic hypergraph decomposition problem motivated by database theory