Decomposable convexities in graphs and hypergraphs

DOI10.1155/2013/453808MaRDI QIDQ1952718zbMATH OpenOpenAlexWikidataFDO

Authors Francesco M. Malvestuto

Publication date 3 June 2013

Published in ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/453808

zbMATH Keywords

acyclic hypergraphconnected hypergraphconvex clusterconvex geometriesconvex hulldecomposabilitydecomposable convexitiesdecomposable convexity spacemaximal clusterssmallest convex set

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposability of abstract and path-induced convexities in hypergraphs
• Canonical and monophonic convexities in hypergraphs
• Equivalence between hypergraph convexities
• On finite convexity spaces induced by sets of paths in graphs
• scientific article; zbMATH DE number 3892078

Cites work

• A fast algorithm for query optimization in universal-relation databases
• Algorithmic Aspects of Monophonic Convexity
• Canonical and monophonic convexities in hypergraphs
• Complexity results related to monophonic convexity
• Connections in acyclic hypergraphs
• Convex sets in a graph
• Convex sets in graphs. II: Minimal path convexity
• Convexities related to path properties on graphs
• Convexity in Graphs and Hypergraphs
• Decomposition of a hypergraph by partial-edge separators
• scientific article; zbMATH DE number 1539530 (Why is no real title available?)
• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• Hull numbers of path convexities on graphs
• Modular Interval Spaces
• 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
• Treewidth. Computations and approximations

Cited in

(6)

• Canonical and monophonic convexities in hypergraphs
• A monadic second-order definition of the structure of convex hypergraphs.
• A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
• Decomposability of abstract and path-induced convexities in hypergraphs
• Equivalence between hypergraph convexities
• scientific article; zbMATH DE number 3892078 (Why is no real title available?)

This page was built for publication: Decomposable convexities in graphs and hypergraphs

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