Pages that link to "Item:Q3768702"
From MaRDI portal
The following pages link to Some New Matroids on Graphs: Cut Sets and the Max Cut Problem (Q3768702):
Displaying 9 items.
- Computational complexity analysis of the sensor location flow observability problem (Q479256) (← links)
- Locating active sensors on traffic networks (Q816421) (← links)
- A construction for binary matroids (Q1102297) (← links)
- Multiterminal xcut problems (Q1179738) (← links)
- The cocycle lattice of binary matroids (Q1260774) (← links)
- On the graphic matroid parity problem (Q1400959) (← links)
- Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
- Minimal invariant sets in a vertex-weighted graph (Q2508971) (← links)
- The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)