"Complexity of the Maximum k-Path Vertex Cover Problem."

Eiji Miyano et al. (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-75172-6_21

access: closed

type: Conference or Workshop Paper

metadata version: 2023-11-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/walcom/MiyanoSUYZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/MiyanoSUYZ18
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM 2018: 240-251

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.