Generating hinges from arbitrary subhypergraphs
From MaRDI portal
Publication:1197992
DOI10.1016/0020-0190(92)90157-QzbMATH Open0764.68033OpenAlexW2002051581MaRDI QIDQ1197992FDOQ1197992
Recommendations
- scientific article; zbMATH DE number 1670855
- Complexity results for generating subgraphs
- Fundamentals of Computation Theory
- Induced subgraphs of hypercubes
- Generating Random Hyperbolic Graphs in Subquadratic Time
- Generating groups using hypergraphs
- Recognizing generating subgraphs revisited
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- Subdivision Drawings of Hypergraphs
- Recognizing hinge-free line graphs and total graphs
Cites work
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- A Complete Axiomatization of Full Join Dependencies
- A simplied universal relation assumption and its properties
- Completeness issues for join dependencies derived from the universal relation join dependency
- Degrees of acyclicity for hypergraphs and relational database schemes
- Maximal objects and the semantics of universal relation databases
- Query Translation Based on Hypergraph Models
- Testing arbitrary subhypergraphs for the lossless join property
This page was built for publication: Generating hinges from arbitrary subhypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197992)
