Abstract
In this paper we present algorithms for finding a shortest path between two vertices of any weighted undirected and directed circulant graph with two jumps. Our shortest path algorithm only requires O(log N) arithmetic steps and the total bit complexity is O(log3N), where N is the number of the graph's vertices. This method has been derived from some Closest Vector Problems (CVP) of lattices in dimension two and with l1-norm. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Gómez, D., Gutierrez, J., Ibeas, Á., Martínez, C., & Beivide, R. (2005). On finding a shortest path in circulant graphs with two jumps. In Lecture Notes in Computer Science (Vol. 3595, pp. 777–786). Springer Verlag. https://doi.org/10.1007/11533719_79
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
