Generating hinges from arbitrary subhypergraphs

DOI10.1016/0020-0190(92)90157-QzbMATH Open0764.68033OpenAlexW2002051581MaRDI QIDQ1197992FDOQ1197992

Authors: L. L. Miller 

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90157-q

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

zbMATH Keywords

hypergraphrelational databasejoin dependencyembedded join dependencyhingefd-hingeuniversal relation interface

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• A simplied universal relation assumption and its properties
• A Complete Axiomatization of Full Join Dependencies
• Degrees of acyclicity for hypergraphs and relational database schemes
• Maximal objects and the semantics of universal relation databases
• Title not available (Why is that?)
• Testing arbitrary subhypergraphs for the lossless join property
• Completeness issues for join dependencies derived from the universal relation join dependency
• Query Translation Based on Hypergraph Models

Cited In (1)

• Decomposing constraint satisfaction problems using database techniques

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)