Chordality properties on graphs and minimal conceptual connections in semantic data models
DOI10.1016/0022-0000(86)90018-8zbMATH Open0625.68076OpenAlexW2026466492MaRDI QIDQ579964FDOQ579964
Authors: Giorgio Ausiello, Alessandro D'Atri 
Publication date: 1986
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(86)90018-8
Recommendations
- Semantic acyclicity on graph databases
- Characterizations and algorithmic applications of chordal graph embeddings
- scientific article; zbMATH DE number 4198043
- Chordal graph models of contingency tables
- scientific article; zbMATH DE number 1670898
- scientific article; zbMATH DE number 1670897
- On the chordality of a graph
- scientific article; zbMATH DE number 1533810
relational databasesbipartite graphsSteiner treeacyclicitychordality propertiesminimal connection among a set of objectssemantic data model
Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Steiner trees, connected domination and strongly chordal graphs
- Degrees of acyclicity for hypergraphs and relational database schemes
- Connections in acyclic hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- Problems with generalized Steiner problems
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- Distance Hereditary Graphs and the Interlace Polynomial
- Alternating cycle-free matchings
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Coding theory motivated by relational databases
- On hypergraph acyclicity and graph chordality
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- A fast algorithm for query optimization in universal-relation databases
- On-line computation of minimal and maximal length paths
- An algorithm for determining minimal reduced-coverings of acyclic database schemes
- Dually chordal graphs
- On locally presented posets
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- A distributed algorithm for determining minimal covers of acyclic database schemes
- Recognizing different types of beta-cycles in a database scheme
- On stable cutsets in graphs
This page was built for publication: Chordality properties on graphs and minimal conceptual connections in semantic data models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579964)
