On a composition of independence systems by circuit identification
From MaRDI portal
Publication:1186136
Recommendations
- scientific article; zbMATH DE number 4214017
- On the intersection of independence systems
- scientific article; zbMATH DE number 426335
- On Systems of Independent Sets
- Systems of conditionally independent sets
- Identifiability of classes of input-output systems
- On independent circuits of a digraph
- scientific article; zbMATH DE number 3885774
- Complexity of identification of input-output systems
- Compact representations of all members of an independence system
Cites work
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- A generalization of max flow—min cut
- Bemerkungen zu Hadwigers Vermutung
- Compositions in the bipartite subgraph polytope
- On the Maximum Weight Clique Problem
- On the acyclic subgraph polytope
- On the cycle polytope of a binary matroid
- On the facial structure of set packing polyhedra
- Weakly bipartite graphs and the max-cut problem
- \(K_ i\)-covers. I: Complexity and polytopes
Cited in
(18)- scientific article; zbMATH DE number 404527 (Why is no real title available?)
- Conflict hypergraphs to define new families of facets for the independence system polytope
- scientific article; zbMATH DE number 4172751 (Why is no real title available?)
- scientific article; zbMATH DE number 4045784 (Why is no real title available?)
- scientific article; zbMATH DE number 3904605 (Why is no real title available?)
- On Abstract Integral Dependence
- Networks with unicyclic connected components and without short cycles
- Weightable and regular independent system
- Composition of graphs and the triangle-free subgraph polytope
- Complete linear descriptions of small asymmetric traveling salesman polytopes
- Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
- One-node cutsets and the dominating set polytope
- scientific article; zbMATH DE number 4106901 (Why is no real title available?)
- The anti-join composition and polyhedra
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)
- More on independence systems
- Facets of the independent path-matching polytope
- scientific article; zbMATH DE number 3914324 (Why is no real title available?)
This page was built for publication: On a composition of independence systems by circuit identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186136)