Summary: Optimal Networks, Congestion
and
Braess' Paradox
D.K. Arrowsmith School of Mathematical Sciences
and
R.J. Mondrag´on, Dept of Electronic Engineering
Queen Mary, University of London
IWCSN - 2007
Guilin, CHINA
Outline
Robust Networks Optimal Networks
Regular Graphs
Not regular
(symmetries?)
Almost regular
Node regular &
Symmetric
Entangled?
Braess?
load

Source: Arrowsmith, David - School of Mathematical Sciences, Queen Mary, University of London

Collections: Mathematics