"On the Complexity of Singly Connected Vertex Deletion."

Avinandan Das et al. (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-48966-3_18

access: closed

type: Conference or Workshop Paper

metadata version: 2020-05-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwoca/DasKMMP020
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/DasKMMP020
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the Complexity of Singly Connected Vertex Deletion. IWOCA 2020: 237-250

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.