Complexity of Matroid Property Algorithms
- 1 February 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (1) , 184-190
- https://doi.org/10.1137/0211014
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Recognizing graphic matroidsCombinatorica, 1981
- Algorithmic versus axiomatic definitions of matroidsPublished by Springer Nature ,1981
- Matroid matching and some applicationsJournal of Combinatorial Theory, Series B, 1980
- The computational complexity of matroid propertiesMathematical Proceedings of the Cambridge Philosophical Society, 1980
- Lower bounds on the worst-case complexity of some oracle algorithmsDiscrete Mathematics, 1978
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- Orientability of matroidsJournal of Combinatorial Theory, Series B, 1978
- Oracle Algorithms for Fixed-Point Problems — An Axiomatic ApproachPublished by Springer Nature ,1978
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965