"On finding maximum disjoint paths with different colors: Computational ..."

Yunyun Deng et al. (2021)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2021.08.009

access: closed

type: Journal Article

metadata version: 2021-09-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/DengGLC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DengGLC21
Yunyun Deng, Longkun Guo, Kewen Liao, Yi Chen:
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms. Theor. Comput. Sci. 886: 157-168 (2021)

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.