The optimal routing of augmented cubes
M Chen, R Naserasr�- Information Processing Letters, 2018 - Elsevier
A routing in a graph G is a set of paths connecting each ordered pair of vertices. Load of an
edge e is the number of times it appears on these paths. The edge-forwarding index of G is
the smallest of maximum loads over all routings. Augmented cube of dimension n, AQ n, is
the Cayley graph (Z 2 n,{e 1, e 2,…, en, J 2,…, J n}) where ei's are the vectors of the
standard basis and J i=∑ j= n− i+ 1 ne j. SA Choudum and V. Sunitha showed that the
greedy algorithm provides a shortest path between each pair of vertices of AQ n. Min Xu and�…
edge e is the number of times it appears on these paths. The edge-forwarding index of G is
the smallest of maximum loads over all routings. Augmented cube of dimension n, AQ n, is
the Cayley graph (Z 2 n,{e 1, e 2,…, en, J 2,…, J n}) where ei's are the vectors of the
standard basis and J i=∑ j= n− i+ 1 ne j. SA Choudum and V. Sunitha showed that the
greedy algorithm provides a shortest path between each pair of vertices of AQ n. Min Xu and�…
Showing the best result for this search. See all results