Pages that link to "Item:Q1687905"
From MaRDI portal
The following pages link to Extension complexity of stable set polytopes of bipartite graphs (Q1687905):
Displaying 9 items.
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- The biclique covering number of grids (Q2335697) (← links)
- Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
- Binary scalar products (Q2673478) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)
- Slack matrices, \(k\)-products, and 2-level polytopes (Q6558684) (← links)
