"Parameterized complexity of finding a spanning tree with minimum reload ..."

Julien Baste et al. (2017)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-12-29

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/BasteGPSST17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BasteGPSST17
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos:
Parameterized complexity of finding a spanning tree with minimum reload cost diameter. CoRR abs/1703.01686 (2017)

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.