Although simple route planning is not as daunting as TSP, there are some similarities, in that it involves a weighted, undirected graph, requiring the algorithm to take into account the cost of ...

More specialised work on graphs admitting vertex-transitive actions by non-abelian simple groups has enhanced our understanding of the interplay between group actions and graph symmetries ...