On hypergraph acyclicity and graph chordality

DOI10.1016/0020-0190(88)90121-4MaRDI QIDQ1114449zbMATH OpenOpenAlexFDO

Authors Alessandro D'Atri, Marina Moscarini

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0020-0190(88)90121-4

zbMATH Keywords

chordal graphshypergraphsacyclicityrelational database theorychordality

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)

Recommendations

• Degrees of acyclicity for hypergraphs and relational database schemes
• Publication:4872629
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• On axioms constituting the foundation of hypergraph theory
• On the notion of cycles in hypergraphs

Cites work

• scientific article; zbMATH DE number 3884212 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A Characterization of Certain Ptolemaic Graphs
• A characterization of ptolemaic graphs
• A characterization of totally balanced hypergraphs
• Characterizations of strongly chordal graphs
• Characterizations of totally balanced matrices
• Chordality properties on graphs and minimal conceptual connections in semantic data models
• Connections in acyclic hypergraphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Distance-hereditary graphs
• Hypergraphs with no special cycles
• Hypergraphs without a large star
• On metric properties of certain clique graphs
• On the Desirability of Acyclic Database Schemes
• Parallel concepts in graph theory
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Steiner trees, connected domination and strongly chordal graphs
• Syntactic Characterization of Tree Database Schemas
• Testing the universal instance assumption
• Tree queries

Cited in

(19)

• On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
• Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A fast algorithm for query optimization in universal-relation databases
• The parallel solution of domination problems on chordal and strongly chordal graphs
• Incidence graphs of biacyclic hypergraphs
• On the Galois lattice of bipartite distance hereditary graphs
• Further study on sizes of acyclic hypergraphs
• Laminar structure of ptolemaic graphs with applications
• Equivalence between hypergraph convexities
• On some partial line graphs of a hypergraph and the associated matroid
• Clique graphs and Helly graphs
• Dually chordal graphs
• Canonical and monophonic convexities in hypergraphs
• Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
• On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
• A formal context for closures of acyclic hypergraphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Connections in acyclic hypergraphs
• Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs

This page was built for publication: On hypergraph acyclicity and graph chordality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114449)