Max-cut and min-flow theorem for coal-transportation networks based on fault-tolerant routing.
Da-Ren ChenHao-Yen ChangYe-Zheng ChenPublished in: ITNAC (2019)
Keyphrases
- fault tolerant
- transportation networks
- max cut
- fault tolerance
- interconnection networks
- road network
- travel time
- traveling salesman problem
- graph model
- distributed systems
- shortest path
- planar graphs
- np hard
- routing protocol
- load balancing
- graph partitioning
- spectral graph
- np complete problems
- routing algorithm
- response time
- search algorithm
- multi objective