Transformation and decomposition of clutters into matroids
From MaRDI portal
(Redirected from Publication:526353)
Recommendations
- From clutters to matroids
- Completion and decomposition of a clutter into representable matroids
- Clutters and matroids
- Clutters and semimatroids
- scientific article; zbMATH DE number 53949
- scientific article; zbMATH DE number 4187860
- Matroid representation of clique complexes
- Matroid representation of clique complexes
- scientific article; zbMATH DE number 3885921
- Decomposition of binary matroids
Cites work
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Bottleneck extrema
- Clutters and circuits
- Clutters and circuits. II
- Clutters and circuits. III
- Clutters and matroids
- Clutters and semimatroids
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Completion and decomposition of a clutter into representable matroids
- From clutters to matroids
- Lower bounds for three algorithms for transversal hypergraph generation
- Matroidizing set systems: A new approach to matroid theory
- Symmetrization of closure operators and visibility
Cited in
(10)- Clutters and matroids
- From clutters to matroids
- Linearly dependent vectorial decomposition of clutters
- scientific article; zbMATH DE number 4191742 (Why is no real title available?)
- Clutters and semimatroids
- Completion and decomposition of a clutter into representable matroids
- About the structure of the blocker of the hyperplanes of a matroid
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Uniform clutters and dominating sets of graphs
- Approximation and decomposition in lattices of clutters
This page was built for publication: Transformation and decomposition of clutters into matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526353)