Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Eiji Miyano et al. (2020)

> Home

Details and statistics

DOI: 10.1587/TRANSFUN.2019DMP0014

access: closed

type: Journal Article

metadata version: 2023-11-12

- view
  authority control:
- export record
  dblp key:
  - journals/ieiceta/MiyanoSUYZ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieiceta/MiyanoSUYZ20
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1193-1201 (2020)

a service of

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.