The complexity of deletion problems for matroids
From MaRDI portal
Recommendations
- A primal-dual approach to approximation of node-deletion problems for matroidal properties
- Approximating Node-Deletion Problems for Matroidal Properties
- On the Complexity of Matroid Isomorphism Problems
- A Parameterized View on Matroid Optimization Problems
- On the Complexity of Some Enumeration Problems for Matroids
Cited in
(5)- Deletion-contraction to form a polymatroid
- GlobaL analysis of the deiete-contract recursion for graphs and matroids
- Approximating Node-Deletion Problems for Matroidal Properties
- scientific article; zbMATH DE number 1763413 (Why is no real title available?)
- scientific article; zbMATH DE number 7278081 (Why is no real title available?)
This page was built for publication: The complexity of deletion problems for matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300502)