"On the parameterized complexity of the Minimum Path Cover problem in DAGs."

Manuel Cáceres et al. (2020)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-10-14

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2007-07575
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2007-07575
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
On the parameterized complexity of the Minimum Path Cover problem in DAGs. CoRR abs/2007.07575 (2020)

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.