On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms

journal contribution

posted on 2025-02-05, 04:57 authored by Y Deng, L Guo, K Liao, Y Chen

On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms

History

Journal

Theoretical Computer Science

Volume

886

Pagination

157-168

Location

Amsterdam, The Netherlands

Publisher DOI

https://doi.org/10.1016/j.tcs.2021.08.009

Open access

No

ISSN

0304-3975

eISSN

1879-2294

Language

eng

Publisher

Elsevier

Publication URL

https://doi.org/10.1016/j.tcs.2021.08.009

Usage metrics

Categories

Keywords

Uncategorised value

Licence

All Rights Reserved

Exports