Pages that link to "Item:Q579964"

The following pages link to Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964):

Displayed 13 items.

• 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)
• An algorithm for determining minimal reduced-coverings of acyclic database schemes (Q2365507) ‎ (← links)
• Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) ‎ (← links)