"Hypergraph Connectivity Augmentation in Strongly Polynomial Time."

Kristóf Bérczi et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ESA.2024.22

access: open

type: Conference or Workshop Paper

metadata version: 2024-09-24

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/esa/BercziCKK24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/BercziCKK24
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. ESA 2024: 22:1-22:19

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.