"On the Parameterized Complexity of Edge-Linked Paths."

Neeldhara Misra, Fahad Panolan, Saket Saurabh (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-19955-5_25

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/csr/MisraP019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/MisraP019
Neeldhara Misra, Fahad Panolan, Saket Saurabh:
On the Parameterized Complexity of Edge-Linked Paths. CSR 2019: 286-298

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.