Equivalence between hypergraph convexities
From MaRDI portal
Publication:410668
DOI10.5402/2011/806193zbMath1238.05186OpenAlexW2124914243WikidataQ58689730 ScholiaQ58689730MaRDI QIDQ410668
Mauro Mezzini, Marina Moscarini, Francesco Mario 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
Related Items
Two classes of graphs in which some problems related to convexity are efficiently solvable ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT ⋮ Decomposability of abstract and path-induced convexities in hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connections in acyclic hypergraphs
- Pruning processes and a new characterization of convex geometries
- Canonical and monophonic convexities in hypergraphs
- Convex sets in a graph
- 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
- A comparison of structural CSP decomposition methods
- Computing simple-path convex hulls in hypergraphs
- Optimal decomposition by clique separators
- The All-Paths Transit Function of a Graph
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- The complexity of acyclic conjunctive queries
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Characterizations of totally balanced matrices
- Algorithmic Aspects of Monophonic Convexity
- Convexity in Graphs and Hypergraphs
