A Polynomial-Time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs.
Pietro CenciarelliDaniele GorlaIvano SalvoPublished in: Algorithmica (2019)
Keyphrases
- computational complexity
- directed graph
- objective function
- cost function
- np hard
- experimental evaluation
- worst case
- learning algorithm
- maximum flow
- segmentation algorithm
- matching algorithm
- detection algorithm
- clustering method
- particle swarm optimization
- dynamic programming
- graph structure
- high accuracy
- optimization algorithm
- computational cost
- significant improvement
- similarity measure
- expectation maximization
- optimal solution
- shortest path problem