Canonical and monophonic convexities in hypergraphs

DOI10.1016/j.disc.2009.01.003zbMath1211.05093OpenAlexW2022236364MaRDI QIDQ1043946

Francesco Mario Malvestuto

Publication date: 10 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.003

zbMATH Keywords

canonical connectionacyclic hypergraphmonophonic convexityfinite convexity spaceMinkowski-Krein-Milman property

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (10)

A new notion of convexity in digraphs with an application to Bayesian networks ⋮ Equivalence between hypergraph convexities ⋮ Unnamed Item ⋮ Computing simple-path convex hulls in hypergraphs ⋮ Decomposable convexities in graphs and hypergraphs ⋮ On the geodeticity of the contour of a graph ⋮ CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT ⋮ On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Decomposability of abstract and path-induced convexities in hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connections in acyclic hypergraphs
• On hypergraph acyclicity and graph chordality
• Convex sets in graphs. II: Minimal path convexity
• A fast algorithm for query optimization in universal-relation databases
• On triangle path convexity in graphs
• Decomposition of a hypergraph by partial-edge separators
• Convexities related to path properties on graphs
• Optimal decomposition by clique separators
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Convexity in Graphs and Hypergraphs
• Bounds for cell entries in contingency tables given marginal totals and decomposable graphs

This page was built for publication: Canonical and monophonic convexities in hypergraphs