Decomposable convexities in graphs and hypergraphs
From MaRDI portal
Publication:1952718
DOI10.1155/2013/453808zbMath1264.05089OpenAlexW1992880576WikidataQ58997007 ScholiaQ58997007MaRDI QIDQ1952718
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
convex hulldecomposabilityconvex geometriesacyclic hypergraphconnected hypergraphconvex clusterdecomposable convexitiesdecomposable convexity spacemaximal clusterssmallest convex set
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Decomposability of abstract and path-induced convexities in hypergraphs ⋮ A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
Cites Work
- Connections in acyclic hypergraphs
- Complexity results related to monophonic convexity
- Pruning processes and a new characterization of convex geometries
- Canonical and monophonic convexities in hypergraphs
- Convex sets in a graph
- Convex sets in graphs. II: Minimal path convexity
- A fast algorithm for query optimization in universal-relation databases
- On triangle path convexity in graphs
- Treewidth. Computations and approximations
- 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
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Monophonic Convexity
- Convexity in Graphs and Hypergraphs
- Modular Interval Spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decomposable convexities in graphs and hypergraphs
