Connections in acyclic hypergraphs

DOI10.1016/0304-3975(84)90030-6zbMath0557.05054OpenAlexW2107782661MaRDI QIDQ762180

David Maier, Jeffrey D. Ullman

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90030-6

zbMATH Keywords

biconnected componentsacyclic hypergraphsGraham reductionindependent pathtableau reduction

Mathematics Subject Classification ID

Hypergraphs (05C65) Connectivity (05C40)

Related Items (16)

Interaction-free multivalued dependency sets ⋮ On hypergraph acyclicity and graph chordality ⋮ Equivalence between hypergraph convexities ⋮ Unnamed Item ⋮ Decomposable convexities in graphs and hypergraphs ⋮ A universal table model for categorical databases ⋮ On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs ⋮ Partially dynamic maintenance of minimum weight hyperpaths ⋮ Chordality properties on graphs and minimal conceptual connections in semantic data models ⋮ A fast algorithm for query optimization in universal-relation databases ⋮ Canonical and monophonic convexities in hypergraphs ⋮ NP-complete problems simplified on tree schemas ⋮ Acyclic join dependency and data base projections ⋮ The tree projection theorem and relational query processing ⋮ GYO reductions, canonical connections, tree and cyclic schemas, and tree projections ⋮ Unnamed Item

Cites Work

• On the Desirability of Acyclic Database Schemes
• Maximal objects and the semantics of universal relation databases
• Power of Natural Semijoins
• A simplied universal relation assumption and its properties
• Equivalences among Relational Expressions
• Unnamed Item

This page was built for publication: Connections in acyclic hypergraphs