"Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and ..."

Guilherme de C. M. Gomes, Ignasi Sau (2021)

> Home

Details and statistics

DOI: 10.1007/S00453-021-00798-8

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GomesS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GomesS21
Guilherme de C. M. Gomes, Ignasi Sau:
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. Algorithmica 83(6): 1677-1706 (2021)

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.