Pages that link to "Item:Q1904657"

The following pages link to A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts (Q1904657):

Displaying 3 items.

• The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
• On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency (Q2638384) (← links)
• On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)