"Parameterized complexity of the MINCCA problem on graphs of bounded ..."

Didem Gözüpek et al. (2017)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2017.06.013

access: closed

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/GozupekOPSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GozupekOPSS17
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690: 91-103 (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.