A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs |
scientific article |
Statements
A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (English)
0 references
25 April 2019
0 references
Braess paradox
0 references
traffic networks
0 references
graph algorithms
0 references
subgraph homeomorphism
0 references
