Characterizing Flow Complexity in Transportation Networks using Graph Homology

Shashank A Deshpande, Hamsa Balakrishnan

Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges…