On the Tractability of Shortest Path Problems in Weighted Edge-Coloured Graphs.
Andrew EnsorFelipe LilloPublished in: J. Syst. Sci. Complex. (2018)
Keyphrases
- shortest path problem
- weighted graph
- shortest path
- edge weights
- directed graph
- single source
- interval data
- graph model
- graph partitioning
- constraint satisfaction
- undirected graph
- maximum weight
- combinatorial optimization problems
- np complete
- computational complexity
- adjacency matrix
- multiple objectives
- directed acyclic graph
- graph structure
- edge detection
- evolutionary algorithm
- objective function
- minimum spanning trees
- spanning tree
- vertex set
- graph matching
- scheduling problem