一类3-连通图上的最优容错路由选择的构成

Constructing Optimal Fault-Tolerant Routins for a Class of 3-Connected Graphs

一类３－连通图上的最优容错路由选择的构成郑晓罗予频杨士元（南京广播电视大学，南京２１００２９）（清华大学自动化系，北京１０００８４）在描述某网络的图中，给各有序的两点定义一条称之为路由（ｒｏｕｔｅ）的通信路径，这就构成了ｒｏｕｔｉｎｇ。当故障发生时...

\ For the reason that no general schemes of constructing an optimal routing on an arbitrary κ connected graph whenκ≥3 are presented up to nowadays,a class of 3-connected graphs can be topoliogized as a bidirectional double-loop LAN, an optimal routing can be constructed,i.e.,its diameter of surviving route graph is no more than 2 whenever the number of faults is less than the connectivity of 3.