"Parameterized Complexity of Directed Steiner Tree on Sparse Graphs."

Mark Jones et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-40450-4_57

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/esa/JonesLRSS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/JonesLRSS13
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA 2013: 671-682

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.