Pages that link to "Item:Q1324027"
From MaRDI portal
The following pages link to Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems (Q1324027):
Displaying 4 items.
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- On polyhedron graph density in problems of combinatorial optimization (Q1326866) (← links)
- (Q3832321) (← links)