A Faster Algorithm for Recognizing Directed Graphs Invulnerable to Braess's Paradox.
Akira MatsubayashiYushi SaitoPublished in: ATMOS (2023)
Keyphrases
- learning algorithm
- directed graph
- dynamic programming
- high accuracy
- objective function
- preprocessing
- memory efficient
- times faster
- worst case
- detection algorithm
- optimization algorithm
- maximum flow
- probabilistic model
- experimental evaluation
- significant improvement
- segmentation algorithm
- input data
- recognition algorithm
- improved algorithm
- undirected graph
- shortest path problem
- k means