Counterexamples to the Uniform Shortest Path Routing Conjecture for Vertex-Transitive Graphs
- Series
- ACO Student Seminar
- Time
- Wednesday, January 28, 2009 - 13:30 for 2 hours
- Location
- ISyE Executive Classroom
- Speaker
- Sangho Shim – ISyE, Georgia Tech
In this article, we disprove the uniform shortest path routing conjecture for vertex-transitive graphs by constructing an infinite family of counterexamples.