Titolo | Pubblicato in | Anno |
---|---|---|
A Polynomial-Time Algorithm for detecting the possibility of Braess Paradox in Directed Graphs | ALGORITHMICA | 2019 |
Inefficiencies in network models: a graph-theoretic perspective | INFORMATION PROCESSING LETTERS | 2018 |
Depletable channels: dynamics, behaviour, and efficiency in network design | ACTA INFORMATICA | 2018 |
Graph theoretic detection of inefficiencies in network models | CEUR Workshop ProceedingsCEUR Workshop Proceedings | 2018 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma