Pages that link to "Item:Q3896841"
From MaRDI portal
The following pages link to Algorithmic versus axiomatic definitions of matroids (Q3896841):
Displaying 12 items.
- Weak orientability of matroids and polynomial equations (Q491739) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- The complexity of parallel search (Q1106664) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- Greedoids and Linear Objective Functions (Q3323971) (← links)
- A new exchange property for matroids and its application to max-min-problems (Q3342227) (← links)
- Minimum cuts, modular functions, and matroid polyhedra (Q3703586) (← links)
- Even circuits in oriented matroids (Q5052170) (← links)
- Color-avoiding connected spanning subgraphs with minimum number of edges (Q6130205) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)