Skip to main navigation Skip to search Skip to main content

Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Fingerprint

Dive into the research topics of 'Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics

Engineering