Pages that link to "Item:Q579964"
From MaRDI portal
The following pages link to Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964):
Displaying 15 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- Recognizing different types of beta-cycles in a database scheme (Q808238) (← links)
- On locally presented posets (Q913830) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- A fast algorithm for query optimization in universal-relation databases (Q1271615) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
- A distributed algorithm for determining minimal covers of acyclic database schemes (Q1333367) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- An algorithm for determining minimal reduced-coverings of acyclic database schemes (Q2365507) (← links)
- Coding Theory Motivated by Relational Databases (Q3092324) (← links)
