Pages that link to "Item:Q1326866"
From MaRDI portal
The following pages link to On polyhedron graph density in problems of combinatorial optimization (Q1326866):
Displaying 7 items.
- The density maximization problem in graphs (Q386420) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems (Q1324027) (← links)
- On graphs of the cone decompositions for the min-cut and max-cut problems (Q1751487) (← links)
- Generic rigidity of molecular graphs via ear decomposition (Q1975368) (← links)
- On the polytope faces of the graph approximation problem (Q3186827) (← links)
- (Q3832321) (← links)