Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
From MaRDI portal
(Redirected from Publication:765344)
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 124521 (Why is no real title available?)
- scientific article; zbMATH DE number 3482351 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- A simplied universal relation assumption and its properties
- Degrees of acyclicity for hypergraphs and relational database schemes
- Enumeration of maximum acyclic hypergraphs
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
- On Quadruple Systems
- On a packing and covering problem
- On the Desirability of Acyclic Database Schemes
- On the spanning tree packing number of a graph: A survey
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Steiner systems 𝑆(5,6,𝑣) with 𝑣=72 and 84
- Syntactic Characterization of Tree Database Schemas
- The \(\alpha \)-arboricity of complete uniform hypergraphs
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)