首页> 外文会议> >Shortest path routing in a class of Cayley graphs of semi-direct product of finite groups

【24h】

Shortest path routing in a class of Cayley graphs of semi-direct product of finite groups

机译：一类有限群半直接乘积的Cayley图中的最短路径路由

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

Recently R.N. Draper (1990) initiated the study of interconnection networks based on Cayley graphs of semi-direct products of two cyclic groups called supertoroids graphs. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. In this paper we described a deterministic, distributed, shortest path algorithm for routing in this class of networks.

机译：最近R.N. Draper（1990）基于两个超群图的两个环状群的半直接乘积的Cayley图，开始了对互连网络的研究。与相同大小的环形线圈相比，此类图形的有趣之处在于它们的直径相对较小。在本文中，我们描述了用于此类网络中路由的确定性，分布式，最短路径算法。

著录项

来源
《》|1995年|P.256-262|共7页
会议地点
作者
Wu; F.-L.; Lakshmivarahan; S.;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类无线电电子学、电信技术;
关键词

相似文献

外文文献
中文文献
专利

1. On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups [J] . Lai Cheng-Nan Theoretical computer science . 2015,第Null期

机译：关于Abelian群的Cayley图中所有最短的顶点-不相交路径的构造
2. Symmetry classes of tensors and semi-direct product of finite abelian groups [J] . Rodtes Kijti, Chimla Kunlathida Linear & Multilinear Algebra: An International Journal Publishing Articles, Reviews and Problems . 2018,第9a12期

机译：有限雅思群体的张量和半直接产品的对称类别
3. Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing [J] . Peyman Faizian, Md Atiqul Mollah, Xin Yuan, IEEE Transactions on Parallel and Distributed Systems . 2018,第1期

机译：带有$ k $的随机正则图和广义De Bruijn图-最短路径路由
4. On the Existence of All Shortest Vertex-Disjoint Paths in Cayley Graphs of Abelian Groups [C] . Cheng-Nan Lai International Computer Symposium . 2015

机译：关于阿比越亚群体Cayley图中所有最短的顶点脱节路径的存在
5. Resilient Routing in Software Defined Networks Utilizing Residue Number System and Shortest Path Fast Re-Routing Technique [D] . Oke, Afeez Adeshina. 2021

机译：利用Reside Number System和最短路径快速重新路由技术，软件定义网络中的弹性路由
6. A shortest-path graph kernel for estimating gene product semantic similarity [O] . Marco A Alvarez, Xiaojun Qi, Changhui Yan 2011

机译：用于估计基因产物语义相似性的最短图核
7. The shortest path problem in the plane with obstacles: a graph modeling approach to producing finite search lists of homotopy classes [O] . Jenkins Kevin Dean 1991

机译：带有障碍物的平面中的最短路径问题：一种图形建模方法，用于生成同伦类的有限搜索列表

Shortest path routing in a class of Cayley graphs of semi-direct product of finite groups

摘要

著录项

相似文献

相关主题

期刊订阅