Characterizing Flow Complexity in Transportation Networks Using Graph Homology.
Shashank A. DeshpandeHamsa BalakrishnanPublished in: IEEE Control. Syst. Lett. (2024)
Keyphrases
- transportation networks
- road network
- digital images
- network design problem
- graph representation
- traveling salesman problem
- graph theory
- polynomial time complexity
- weighted graph
- graph structure
- structured data
- random walk
- image sequences
- bipartite graph
- connected components
- directed acyclic graph
- graph mining
- travel time
- worst case
- lower bound