"Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs."

Matthew Johnson et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SWAT.2024.29

access: open

type: Conference or Workshop Paper

metadata version: 2024-06-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/swat/0002MPPSL24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/0002MPPSL24
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT 2024: 29:1-29:17

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.