Algorithmic versus axiomatic definitions of matroids
From MaRDI portal
Publication:3896841
DOI10.1007/BFb0120924zbMath0449.90066MaRDI QIDQ3896841
Publication date: 1981
Published in: Mathematical Programming Studies (Search for Journal in Brave)
complexityalgorithmsmatroidsoraclepolynomial reducibilityindependence systemsaxiomatic definitionequivalent definitionsalgorithmic definitiongirth function
Related Items
Minimum cuts, modular functions, and matroid polyhedra, Even circuits in oriented matroids, The complexity of parallel search, Algorithmic uses of the Feferman-Vaught theorem, Color-avoiding connected spanning subgraphs with minimum number of edges, Matroid Intersection under Restricted Oracles, Weak orientability of matroids and polynomial equations, Greedoids and Linear Objective Functions, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, A new exchange property for matroids and its application to max-min-problems, Complexity of packing common bases in matroids, Recent trends in combinatorial optimization