On the Efficiency of Representability Tests for Matroids
- 30 September 1982
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 3 (3) , 275-291
- https://doi.org/10.1016/s0195-6698(82)80039-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Alpha-balanced graphs and matrices and GF(3)-representability of matroidsJournal of Combinatorial Theory, Series B, 1982
- Detecting Matroid MinorsJournal of the London Mathematical Society, 1981
- Recognizing graphic matroidsCombinatorica, 1981
- Converting Linear Programs to Network ProblemsMathematics of Operations Research, 1980
- An efficient PQ-graph algorithm for solving the graph-realization problemJournal of Computer and System Sciences, 1980
- Decomposition of regular matroidsJournal of Combinatorial Theory, Series B, 1980
- The computational complexity of matroid propertiesMathematical Proceedings of the Cambridge Philosophical Society, 1980
- GRAPH-REALIZABILITY OF MATROIDSAnnals of the New York Academy of Sciences, 1979
- The dependence graph for bases in matroidsDiscrete Mathematics, 1977
- Lectures on matroidsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965