Minimum 2-terminal routing in 2-jump circulant graphs
B. Robič ; J. Žerovnik
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
A 2-jump circulant is an undirected graph whose nodes are integers 0,1, …,  n - 1 and each node u is adjacent to four nodes u ± h1(mod n), u ± h2(mod n), where O < h1 < h2 < n. An algorithm for routing a packet along the shortest path between a pair of processors in 2-jump circulant network is given. The algorithm requires Q(d) time for preprocessing, and l routing steps, where d is the diameter of the graph and l = O(d) is the distance between the two processors.
Publié le : 2012-01-26
Classification:  
@article{cai552,
     author = {B. Robi\v c and J. \v Zerovnik},
     title = {Minimum 2-terminal routing in 2-jump circulant graphs},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai552}
}

B. Robič; J. Žerovnik. Minimum 2-terminal routing in 2-jump circulant graphs. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai552/