"On the Parameterized Complexity of Maximum Degree Contraction Problem."

Saket Saurabh, Prafullkumar Tale (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.IPEC.2020.26

access: open

type: Conference or Workshop Paper

metadata version: 2022-04-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/iwpec/0001T20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/0001T20
Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Maximum Degree Contraction Problem. IPEC 2020: 26:1-26:16

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.