Pages that link to "Item:Q5870380"

The following pages link to Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380):

Displaying 3 items.

• Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
• A polynomial time algorithm for finding a minimum 4-partition of a submodular function (Q6608049) (← links)
• Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)