Equivalence between hypergraph convexities

DOI10.5402/2011/806193MaRDI QIDQ410668zbMATH OpenOpenAlexWikidataFDO

Authors Mauro Mezzini, Marina Moscarini, Francesco M. Malvestuto

Publication date 3 April 2012

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

Full work available at URL https://doi.org/10.5402/2011/806193

zbMATH Keywords

\(c\)-convexity\(m\)-convexityap-convexitysp-convexity

Mathematics Subject Classification ID

Hypergraphs (05C65) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Recommendations

• Canonical and monophonic convexities in hypergraphs
• Convexity in Graphs and Hypergraphs
• Decomposable convexities in graphs and hypergraphs
• Decomposability of abstract and path-induced convexities in hypergraphs
• Computing simple-path convex hulls in hypergraphs

Cites work

• scientific article; zbMATH DE number 3845624 (Why is no real title available?)
• scientific article; zbMATH DE number 3509596 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A comparison of structural CSP decomposition methods
• A fast algorithm for query optimization in universal-relation databases
• Algorithmic Aspects of Monophonic Convexity
• Canonical and monophonic convexities in hypergraphs
• Characterizations of totally balanced matrices
• Computing simple-path convex hulls in hypergraphs
• Connections in acyclic hypergraphs
• Convex sets in a graph
• Convex sets in graphs. II: Minimal path convexity
• Convexity in Graphs and Hypergraphs
• Decomposition of a hypergraph by partial-edge separators
• Degrees of acyclicity for hypergraphs and relational database schemes
• Hull numbers of path convexities on graphs
• On hypergraph acyclicity and graph chordality
• On the Desirability of Acyclic Database Schemes
• On triangle path convexity in graphs
• Optimal decomposition by clique separators
• Pruning processes and a new characterization of convex geometries
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The All-Paths Transit Function of a Graph
• The complexity of acyclic conjunctive queries

Cited in

(8)

• Canonical and monophonic convexities in hypergraphs
• Two equivalent measures on weighted hypergraphs
• Computing simple-path convex hulls in hypergraphs
• A new notion of convexity in digraphs with an application to Bayesian networks
• Two classes of graphs in which some problems related to convexity are efficiently solvable
• Decomposability of abstract and path-induced convexities in hypergraphs
• Decomposable convexities in graphs and hypergraphs
• Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent

This page was built for publication: Equivalence between hypergraph convexities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410668)