Counterexamples to the Uniform Shortest Path Routing Conjecture for Vertex-Transitive Graphs

Series: 
ACO Student Seminar
Wednesday, January 28, 2009 - 13:30
2 hours
Location: 
ISyE Executive Classroom
,  
ISyE, Georgia Tech
Organizer: 
In this article, we disprove the uniform shortest path routing conjecture for vertex-transitive graphs by constructing an infinite family of counterexamples.