On the efficiency of representability tests for matroids
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3750970 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3598496 (Why is no real title available?)
- scientific article; zbMATH DE number 3365295 (Why is no real title available?)
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- An efficient PQ-graph algorithm for solving the graph-realization problem
- Converting Linear Programs to Network Problems
- Decomposition of regular matroids
- Functions of Bounded Second Variation and Stieltjes-Type Integrals
- Lectures on matroids
- On Whitney's 2‐isomorphism theorem for graphs
- On the efficiency of representability tests for matroids
- Recognizing graphic matroids
- The computational complexity of matroid properties
- The dependence graph for bases in matroids
Cited in
(11)- On the efficiency of representability tests for matroids
- Partial matroid representations
- Recognising graphic and matroidal connectivity functions
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- On powers of Plücker coordinates and representability of arithmetic matroids
- A decomposition theory for matroids. I: General results
- A decomposition theory for matroids. III. Decomposition conditions
- On the classification of ideal secret sharing schemes
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- A decomposition theory for matroids. II. Minimal violation matroids
This page was built for publication: On the efficiency of representability tests for matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835922)
