"Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning ..."

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang (2022)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2022.16

access: open

type: Conference or Workshop Paper

metadata version: 2022-06-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/icalp/BeidemanC022
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/BeidemanC022
Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k. ICALP 2022: 16:1-16:18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.