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

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

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.

Keyphrases

Mathematics

Engineering