On hypergraph acyclicity and graph chordality
From MaRDI portal
Publication:1114449
DOI10.1016/0020-0190(88)90121-4zbMATH Open0662.68111OpenAlexW2016035215MaRDI QIDQ1114449FDOQ1114449
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
Recommendations
- Degrees of acyclicity for hypergraphs and relational database schemes
- scientific article; zbMATH DE number 859448
- 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
Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizations of strongly chordal graphs
- Distance-hereditary graphs
- Parallel concepts in graph theory
- Characterizations of totally balanced matrices
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- A characterization of ptolemaic graphs
- Title not available (Why is that?)
- On metric properties of certain clique graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Steiner trees, connected domination and strongly chordal graphs
- Testing the universal instance assumption
- Degrees of acyclicity for hypergraphs and relational database schemes
- A characterization of totally balanced hypergraphs
- Syntactic Characterization of Tree Database Schemas
- Hypergraphs with no special cycles
- Connections in acyclic hypergraphs
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- A Characterization of Certain Ptolemaic Graphs
- Title not available (Why is that?)
- Tree queries
- Hypergraphs without a large star
Cited In (19)
- On the Galois lattice of bipartite distance hereditary graphs
- On some partial line graphs of a hypergraph and the associated matroid
- Equivalence between hypergraph convexities
- Connections in acyclic hypergraphs
- 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
- Canonical and monophonic convexities in hypergraphs
- Incidence graphs of biacyclic hypergraphs
- A fast algorithm for query optimization in universal-relation databases
- Clique graphs and Helly graphs
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- Dually chordal graphs
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
- A formal context for closures of acyclic hypergraphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- Further study on sizes of acyclic hypergraphs
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- Laminar structure of ptolemaic graphs with applications
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic 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)
