1.Introduction

The average path length of a network,often called network diameter,is usually regarded as one of the important characteristic parameters [1,2] to distinguish network types(such as regular network,stochastic network and complex network)and to measure network performances(such as node importance and network survivability).The common formula for calculating the network diameter is shown as follows:

It can be seen from(1)that network diameter D is the ratio of the sum of the shortest path lengths for all node pairs to the number of node pairs.n is the number of node pairs,representing the network size.dijis the length of the shortest path between node i and node j.The network diameter describes the average minimum number of edges between any two nodes in a network,which represents the closeness of network nodes on the whole[3,4].

If a large-scale complex network is considered with a special connection way,difficulty in direct calculation of network diameter lies in how to search and count the shortest paths efficiently[5].Searching the shortest paths has always been an important topic in the study of complex networks[6–8].Typical searching algorithms include Floyd,Dijkstra,Warshall[9], A*algorithm,ant colony algorithm,parallel computing[10–12]and other intelligent algorithms.The advantage of using these algorithms lies in the generality for different network types.However,the disadvantage lies in the efficiency.For example,the time complexity of the Floyd algorithm or the Warshall algorithm is o(n3),which is applicable for small-scale networks.However,for large-scale networks,the speed of the current computer is often insufficient for completing these algorithms execution within an acceptable time.

主人走了几十步，转身，向大狗趴着的方向望去，脸上突然放出光来，对往前赶的族人大喊，不走了，不走了，这里好风好水，留下吧。

Except the direct way,people also try to use indirect way to calculate the network diameter of a complex network.There are two tendencies for the indirect way.One is to study the statistical function about the relationship between network diameter D and network size n so as to calculate D through the simple and intuitive parameter n.The other is to study parameters influencing D in a specific network type so as to calculate D through these parameters.For example,the network diameter of a stochastic network is generally expressed as D∼ln(n);Albert et al.[13]proposed a prediction formula 0.35+2.06lg(n)for calculating the diameter for the WWW network;Lu et al.[14]proposed calculation formulas for different complex network types based on the network size,but it is difficult to explain the complicated relationship between the network topology and the network diameter by calculating the network diameter through the network size.Networks even with the same size may have different total numbers of edges and different connection ways between nodes.As a result,these networks may have different diameters.Through(1),it also can be intuitionisticly analyzed that the network diameter shows a non-monotonic functional relationship with the network size because the numerator and the denominator of(1)correlate positively with the network size.In fact,just because of this relationship,complex networks show some amazing features,such as small world,high concentration and free scale.For example,when the size of some complex networks increases rapidly,such as exponential network and scale free network,the diameter does not increase significantly.Two persons in a social network consisted of billions of people can interrelate each other by six jumps on the average.The diameter of the WWW network is only 11.2 jumps but it has 325 729 nodes.And the scale-free network will show “robust and fragile”characteristics when it is attacked[15].In addition,for networks with the same type such as two WWW networks,even they are all conforming to power-law degree distribution p(k) ∼ k-α,the exponential α may be different.A formula with only one parameter n cannot describe the influence of different α.Considering this,Li et al.[16]built a distribution p(l)about the lengths of the shortest paths which only have parameter α to represent the node connection mode and the total number of edges in Internet with power-law degree distribution p(k)∼ k-α.That means if the exponential α of Internet is calculated statistically,the distribution p(l)about the lengths of the shortest paths will be defined.If the network size n is also gotten,diameter D of Internet can be calculated finally.However,it is the same difficult to indirectly calculate the exponential α as to directly calculate the number of the shortest paths in a network.Meanwhile,this approach cannot apply to all types of networks.

To solve these problems,an algorithm based on the k order distance matrix is proposed as well as mathematical justification for its correctness.Furthermore,some relevant propositions and deductions for reducing complexity of the algorithm are put forward.Finally,effect of this algorithm is verified by two cases study.

2.Definition of k order distance matrix with its solution algorithm

2.1 Definition of k order distance matrix

Therefore,it can be inferred that ifis true.

2.2 Solution algorithm for k order distance matrix

(i)Assume the connection matrix of the network is Cn=[cij]n×n,where

The first order distance matrix of the network equals the connection matrix,that is=Cn,where

“场”既是场所，又是作用。爱因斯坦认为，“场”是相互依存事实的整体，概言之，万事万物，几事几物，都能构成相应的“场”。“情感场”是以情感为作用方式的场，亦是以情感为存在方式的场。“校园情感场”是以校园为基本范畴的情感场，生成于校园，主要存在于校园。但由于“场”的辐射性特点，如果处在射线端点，我们期望这根射线延伸得长远一些，影响孩子的一生；如果处在圆心位置，我们期望这个圆的覆盖面积广一些，产生良好的社会效应。

(ii)Assume the kth(k≥1)power of the connection matrix Cnis ,the(k+1)th power of Cnisequals the number of paths between node i and node j whose length is k+1(there may be some repeated edges or nodes in a path)is actually a number matrix of paths in the network whose length is k+1.If the k(k≥1)order distance matrix of the network is Dkn,then the k+1 order distance matrix is

另一方面，安全存储需要解决如何保证数据的安全性问题。而数据加解密技术是解决该问题的有效途径之一，同时也是数据安全存储的核心技术。在数据的安全存储中，利用加密技术将数据变为乱码存储，在使用数据的时候，应用解密技术将被加密数据还原。数据在存储和使用时在密文和明文状态两种方式切换，保证数据安全的同时又方便用户使用。

(iii)The correctness of this algorithm is proved as follows:

i)If＞0:it can be inferred according to the definition of the distance matrix that there must be a shortest path between node i and node j whose length is less than or equal to k.Because the length of the shortest path is fixed,

ii)If=0 and i/=j:assumethere must be a path between node i and node j whose length is k+1.Ifthis path is not the shortest path between nodei and node j,there must be a shortest path between node i and node j whose length is less than k+1,its length can be assumed as k′(k′≤ k).Because i/=j,k′＞ 0.It can be inferred according to the definition of the distance matrix that=k′＞ 0.This result is contradictory with the prerequisite of =0.Therefore,that path must be the shortest path between node i and node j,and the length of that path is k+1,that is

以三菱FR-D700变频器为例，使S7-200 PLC与变频器以modbus RTU通讯方式通讯，需要对三菱FR-D700变频器做的参数设置如下：

iii)If =0 and i/=j:assumethere should not be a path between node i and node j whose length is k+1.If there is a shortest path between node i and node j whose length is less than k+1,its length can be assumed as k′(k′≤ k).Because i/=j,k′＞ 0,it can be inferred according to the definition of the distance matrix thatThis result is contradictory with the prerequisite ofTherefore,there is no shortest path between node i and node j whose length is less than k+1.It can be inferred according to the definition of the distance matrix that

iv)Ifi=j:it is apparent that the distance between node i and node j is zero,that is

2.3 A solution algorithm for k order distance matrix

Assume the n order distance matrix of a network isthe diameter of the network is

It is obvious that the distance between any two nodes will not exceed n in a network whose size is n,which can be reached and calculated before the n order distance matrix Dnnis constructed.Thus the correctness of this algorithm can be proved according to(1).

3.Methods for improving efficiency of the solution algorithm for network diameter

The algorithm mentioned above calculates values of elements in the k order distance matrix by connection matrix multiplication.The time complexity of matrix multiplication[17]is generally O(n3).n matrix multiplications are adopted to calculate the n order distance matrix ,so the final time complexity of the algorithm is O(n4).Compared with the Floyd algorithm et al.with the time complexity of O(n3),efficiency of the algorithm above does not improve but reduces by an order of magnitude.

The second way to improve efficiency of the proposed algorithm is to minimize the number of matrix multiplications.For most kinds of networks,especially for complex networks,to minimize the number of matrix multiplications is feasible because of their small-world characteristic.For example,on the average two persons can interrelate each other through six jumps in the social network consisted of more than seven billion people.Therefore,to calculate the social network diameter through the proposed algorithm does not actually need seven billion times of matrix multiplications.Some relevant propositions and deductions for minimizing the number of matrix multiplications are presented below for improving efficiency of the proposed algorithm.

To improve efficiency of the algorithm so as to be applicable for large-scale networks,you should start with the optimization of the time complexity of the matrix multiplication.The time complexity of matrix multiplication should be optimized firstly.For a long time,nobody doubts matrix multiplication can be completed fewer than n3times.Until 1969,Strassen[18]reduced the time complexity of matrix multiplication from O(n3)to O(n2.807 355).In 1981,Pan[19]reduced the time complexity to O(n2.494).In 1987,Coppersmith and Winograd[20,21]reduced the time complexity to O(n2.376).In2010,Stothers[22]reduced the time complexity to O(n2.374).In 2011,Williams[23]reduced the time complexity to O(n2.372 864);in 2014,Gall[24]reduced the time complexity to O(n2.372 863).For a large-scale network,the complexity of O(n2.372 863)is a very large increase than the complexity of O(n3),as is shown in Fig.1 below.These work also laid a good foundation for the proposed algorithm to calculate the diameter of large-scale networks by matrix multiplications.

Fig.1 Comparison on time complexity of matrix multiplication before and after optimization

丁主任早上7点起床，拖着深蓝色的胶拖鞋，端着圆木盖的白色痰盂，吧唧吧唧地上厕所。厕所离甲洛洛家门不到五米，因此，甲洛洛只需在门外把漱口的时间拖得够长，或不出家门守在窗边即可观察到他。甲洛洛还是喜欢前者，躲在窗边，始终觉得不够磊落。

随着燃料乙醇和食品加工中伴生的液体副产品产量增加、果蔬种植规模化伴生的鲜基饲用资源增加，加上环保要求趋严、饲料成本上升，促进了液体农副产品、鲜基地源饲料和发酵液体饲料的应用和推广，液体饲料具有广阔的发展前景[1]。

3.1 Propositions and deductions for improving algorithm efficiency

Lemma 1 The lengths of the shortest paths in a network are consecutive natural numbers in range[0,l],where l is the maximum length of the shortest paths in the network.

Proof(i)Assume that there is a shortest path path1:i→ ···→ m → j between node i and node j with length k in the network,where node m is the previous node of node j in the path and k(k≥2)is the number of edges in the path.There must be a shortest path between node i and node m.Assume this path is path2:i→ ···→ m.If the length of this path is greater than k-1,node i can reach node m through path1 with length k-1,which is contradictory with the second assumption that path2 is the shortest path between node i and node m.If the length of this path is less than k-1,nodei can reach node j through path3:path2→j with the length less than k,which is contradictory with the first assumption that the length of the shortest path between node i and node j is k.Therefore,the length of the shortest path between node i and node m must be k-1.It can be concluded that if there is a shortest path with length k in a network,there must be a shortest path with length k-1.

(ii)If l(l≥2)is the maximum length of the shortest paths in a network,it can be inferred according to demonstration(i)that there must be a shortest path with length l-1in the network.The otherlengths less than l-1can be inferred similarly.At last,it can be inferred that there must be a shortest path with length 1.Obviously,the length of the shortest path from node i to itself is 0.Therefore,the lengths of the shortest paths in a network are consecutive natural numbers in range[0,l]. □

Proposition1 Assume the k(k∈(0,l])order distancematrix of a network with n nodes iswhere l(l＞0)is the maximuml ength of the shortest paths in the network,then max(d)=k must be true.

Proof(i)Assume k=1,it must be inferred according to the definition of the distance matrix that max()≤1.At this time,the distance matrix of the network equals the connection matrix of the network,namely =Cn.If max()＜1,all elements in distance matrixare zero,which means there is no adjacent edge between any two nodes in the network,there is no path between any two nodes and the maximum length of the shortest paths in the network is also zero.This conclusion is contradictory with prerequisite l＞0,so max()=1 must be true.The proposition is thus demonstrated.

(ii)Assume max()=k is true.There must be a shortest path with length k in the network.If k+1≤l,it can be inferred according to Lemma 1 that the lengths of the shortest paths are consecutive natural numbers in range[0,l],and there must be a shortest path with length k+1 in the network.It can be inferred according to the definition of the distance matrix that max+1 is true.(iii)It can be inferred that for k∈(0,l],maxmust be true.

随着民生事业社会管理进程的不断推进，殡葬行业较之以往无人愿意提及，到现在已经成为涉及民生的社会关注焦点。国家对改进殡葬行业服务质量的急需，逝者家属对亲人未尽情怀的过度表达期待，社会媒体对殡葬行业关注度的提高，使殡葬行业从业者从过去被漠视、被轻视，到迅速推至大众视野，成为备受关注的民生工程的执行者。这是时代发展、社会需求的直接体现。因此，在现代社会殡葬文化的背景下，获得具有崇高职业价值感和坚定社会责任感，将是青年一代从业人员更为注重的。

This proposition shows that the maximum value of the distance matrix is increasing progressively in range(0,l]with order k of the distance matrix. □

Willis（1996）将“任务型教学法”分为三个阶段：阶段一为前任务（pre-task）。教师引入任务，呈现完成任务所需的知识，介绍任务的要求和实施的步骤；阶段二为任务环(task cycle)。在这个阶段，教师应放手让学生去执行任务，并鼓励学生相互合作，然后向全班汇报任务完成情况；阶段三为后任务(post-task)。此阶段的重点是语言点，包括分析和操练两部分。先由学生分析并评价其他组任务的完成情况，然后在教师的指导下练习语言重点和难点。

This deduction shows that when =appears for the first time in the solution algorithm of the k order distance matrix of a network,k is the maximum length of the shortest paths in the network,and is the final distance matrix of the network.At this time,the derivation of the solution algorithm of the k order distance matrix of the network can be stopped. □

(iii)If k＞l,it can be inferred according to Proposition 2 that ifmust be true,namely the distance matrix no longer changes.Therefore,is the final distance matrix of the network,and the minimum value of k equals the maximum length l of the shortest paths in the network.

(ii)Because l is the maximum length of the shortest paths in the network,it can be inferred according to(3)that for

i)Ifis true;

ii)If and i/=j,It can be inferred that l＞k,which is contradictory with proof(i).Therefore,the prerequisite is false;

iii)If and i=and

Definition 1 The k(k＞0)order distance matrix of a network with n nodes iswhere

Deduction 1 Ifis the final distance matrix of the network.

Proof It can be inferred according to Proposition2 that ifis true(i≥1),namely the distance matrix will no longer change.Therefore,is the final distance matrix of the network.

i)Ifit can be inferred according to(3)thatwhich is contradictory with the prerequisite

It can be inferred according to Deduction 1 that whenappears,the derivation of the solution algorithm for the k order distance matrix of the network can be stopped,which can improve algorithm efficiency.Complex network,such as exponential network or scale-free network often has small-world effect.Thus the final distance matrix can be derived by several steps based on the 1 order distance matrix. □

Deduction 2 Ifthe minimum value of k is the maximum length of the shortest paths in a network.

Proof(i)If 0＜k＜l,it can be inferred according to Proposition 1 that the maximum value in the distance matrix increases progressivelywith order k in the range(0,l].Thusis true,which is contradictory with the prerequisite

(ii)If k=l andmust be true.is true.

肌理技法不仅是工笔花鸟画中的一种技法，也是作者的思想感情和个性的表达。就像色彩和线条等的表现一样，都可以表达艺术家内心的情感和自己独特的思维，不同形式的肌理效果表达了作者不同的思想感情。肌理的产生使画面效果变得更加有深度感，引发人们不断地去思考，去创新。它也使画面变得更加的生动、活泼，带给人们一种新的空灵感。

1.1.2 试剂 镉单元素标准溶液(1 000 μg/mL，中国计量科学院)；硝酸钠和无水氯化钙，均为分析纯。

ii)IfthenIt can be inferred according to(3)that if and i/=j,thenwhich is contradictory with the prerequisite that l is the maximum length of the shortest paths in the network.If must be true,which is contradictory with the prerequisite

iii)It can be inferred according to i)and ii)thatcannot be true,socannot be true.It can be inferred that if k=l then

农产品的类别特别多，然而当前国内对于农产品缺乏详细地标准，无论哪一种食品均存在好坏的差别，然而在农产品市场上并未结合具体情况制定相关的标准，这便较易导致交易双方在认知上存在一定地偏差。很多农产品在流入市场以前，在品质与售价方面均是不规范的，顾客在选购产品时，也无法分辨产品的好坏，为此，会偏向于选购部分有明确标准的进口农产品，这对于国内农业的发展是非常不利的。

Proof(i)Assume l is the maximum length of the shortest paths in the network.According to Proposition 1,if k≤l,max and max-1 must be true,thenmust be true,which is contradictory with the prerequisite.Thus it can be inferred that ifthen k＞l.

Proposition 2 Assume the k(k＞0)order distance matrix of a network with n nodes isthen

It can be inferred according to Proposition1 and Deduction 2 that the maximum element value max(dij)of the k order distance matrix of a network increases progressively with order k,and when k≥l,max(dij)and will no longer change,as is shown in Fig.2.

用3550 t大型镁合金热室压铸设备，浇注AE44镁合金雷达外壳压铸件．雷达外壳为八边形复杂薄壁件，边长为330 mm，凸起圆台最大外缘直径720 mm，最大壁厚5 mm，最小壁厚3 mm，表面凸起圆台和加强筋较多，零件三维模型如图1所示．

Fig.2 Variation of maximum values max(dij)with k

3.2 Analysis of algorithm efficiency

Propositions and deductions proposed above provide a simple,direct and effective judgment for calculating a large-scale network diameter by matrix multiplications with fewer orders,which also provide a good rationale for improving efficiency of the proposed algorithm.If the time complexity of matrix multiplication is O(n2.372 863),the maximum length of the shortest paths in a network is a constant l,the time complexity of the proposed algorithm is O(l∗n2.372 863).When1 ＜ l＜ n0.627 137,the proposed algorithm is more efficient than the Floyd algorithm et al.with a time complexity of O(n3).The smaller l is when it is compared with n,the more efficient the proposed algorithm is,which means the larger size and the clearer small world effect a network has,the more efficient the proposed algorithm is.For example,if the WWW network is considered and the maximum length of the shortest paths in it is assumed as 11.2 jumps,the relationship between the time complexity of the proposed algorithm and the network size n is shown in the figures below.From the figures,it can be seen that the efficiency advantage of the algorithm is unobvious when the network size is small.However,efficiency of the algorithm is greatly improved after optimization than before optimization when the network size reaches 1 000(as is shown in Fig.3).And efficiency of the algorithm is also greatly improved if compared with the Floyd algorithm et al.with a time complexity of O(n3)(as shown in Fig.4).The larger the network size is,the more obvious the efficiency advantage is.Thus the proposed algorithm is suitable for calculating diameters of large-scale complex networks with small-world effect.

Fig.3 Comparison on time complexity of the proposed algorithm before and after optimization

Fig.4 Comparison on time complexity of Floyd algorithm et al.and the proposed algorithm

4.Cases study

To verify correctness and effect,diameters of the ARPA network and Chinese airline network are calculated and analyzed according to the proposed algorithm.

4.1ARPA network

The ARPA network shown in Fig.5 is a trunk network topology,which consists of 21 nodes and 23 links.

Fig.5 ARPA network topology model

According to the proposed algorithm,a corresponding connection matrix is established for this network firstly.Then the network diameter is calculated.The distance matrix for this network does not change when it reaches seven order.It shows that the maximum length of the shortest path in this network is 7,which means any two nodes can be linked to each other through at most seven jumps.And the network diameter is 3.467 through calculation,which means any two nodes can be linked to each other through fewer than four jumps on average.

For the ARPA network,time complexity of the algorithm is O(7∗212.372 863).Because 7＞210.627 137=6.748 6,the proposed algorithm has no efficiency advantage for calculating the network diameter if compared with the Floyd algorithm et al.,whose time complexity is O(213).In turn,it can be inferred that the ARPA network is not a typical complex network with an obvious small-world effect.Through the calculation result discussed above,the inference can be confirmed.Because the network size is not very large,but the longest length of the shortest path is not as small as the network diameter,the complex network characteristic of ARPA network is not strong.

4.2 Chinese airline network

Chinese airline network topology shown in Fig.6 consists of 161 urban airport nodes and 1 185 undirected edges(2 370 airlines).The data samples adopted are collected from airport flights in the summer and autumn of 2010,provided by Civil Aviation Resource Net of China.The samples do not include data about Hongkong,Macao and Taiwan.In addition,irregular flights are not included in the statistics.The reason for using these samples is that it is convenient to analyze and compare the conclusions with the conclusions in[25].

Fig.6 Chinese airline network topology model

For this network, a corresponding connection matrix can be established,and the algorithm proposed is adopted to calculate the network diameter.Besides,it can be found that the distance matrix for this network will no longer change when the order of the distance matrix reaches 3,namely matrix multiplications are performed for three times.It shows that the maximum length of the shortest path in the network is 3,and the maximum number of station transfers from one airport to another airport is up to three times.And the network diameter is 2.137 5 by calculation,which shows that any two airports can be linked to each other by about two transfers on average.This result is basically approximate with the network diameter calculated by the Warshall-Floyd algorithm adopted in[25].Chinese airline network has a verylargesize.However,the average distance between two nodes is very small.Thus it has a clear small-world effect.For this network,time complexity of the proposed algorithm is O(3∗1612.372 863).Compared with the Warshall-Floyd algorithm et al.with time complexity O(1613),the proposed algorithm has an obvious efficiency advantage.

5.Conclusions

Because network topology is equivalent to its connection matrix,the network diameter calculated according to the algorithm proposed in this paper is accurate but not statistical.In addition,the algorithm is universal rather than for specific types of networks.The values of elements in the distance matrix are revised constantly through matrix multiplications until all of the shortest paths between two nodes are counted.Differences between the proposed algorithm and other algorithms like Floyd lie in that:(i)definition of the distance matrix is different from that proposed in other algorithms;(ii)the values of elements in the distance matrix are not calculated directly by iterated distance matrix multiplications,but indirectly by iterated connection matrix multiplications.These differences are not helpful to improve algorithm complexity.However,adoption of this definition and algorithm can set up relevant propositions and deductions with strict mathematical justification basis.The propositions and deductions are concise,simple and easy for use,which can greatly reduce time complexity of the solution algorithm.From verifications of two examples,it can be seen that the proposed algorithm based on the k order distance matrix is correct for calculating the network diameter,which can greatly improve solution efficiency of large-scale networks diameters,especially of complex networks with small-world effect.

References

[1]DA F,COSTA L,EVSUKOFF A,et al.Communications in computer and information.Berlin:Springer Verlag,2011.

[2]GU L,HUANG H L,ZHANG X D.The clustering coefficient and the diameter of small-world networks.Acta Mathematica Sinica,2013,29(1):199–208.

[3]HUNG J,YEN N,LI K C.Frontier computing.Singapore:Springer Verlag,2016.

[4]SQUILLERO G,SIM K.Applications of evolutionary computation.Zug:Springer Verlag,2017.

[5]GAO J,EFRAT A,FEKETE S,et al.Algorithms for sensor systems.Berlin:Springer Verlag,2015.

[6]YANG J,FANG F,SUN C.Intelligent science and intelligent data Engineering.Berlin:Springer Verlag,2013.

[7]SU X,HE T.Chinese lexical semantics.Zug:Springer Verlag,2014.

[8]HERNÁNDEZ C B,GITLER I,KLAPP J.High performance computing.Zug:Springer Verlag,2017.

[9]HOFNER P,MOLLER B.Dijkstra Floyd and Warshall meet Kleene.Formal Aspects of Computing,2012,24(4/6):459–476.

[10]CORMEN T H,LEISERSON C E.Introduction to algorithm.3rd ed.London:The MIT Press,2009.

[11]COLORNI A,DORIGO M,MANIEZZO V.Distributed optimization by ant colonies.Proc.of CAL91-European Conference on Artificial Life,1991:134–142.

[12]NI X J,ZHANG N,WANG M J.An MPI based parallel algorithm to calculate the shortest path of CERNET.Computer Engineering and Applications,2006,42(12):135–137.(in Chinese)

[13]ALBERT R,JEONG H,BARABASI A L.Internet:diameter of the world-wide web.Nature,1999,401(6749):130–131.

[14]FAN C,LU L Y.The diameter of sparse random graphs.http://math.ucsd.edu/∼fan/dia.pdf.

[15]ALBERT R,JEONG H,BARABASI A L.Error and attack tolerance of complex networks.Nature,2000,406(6794):378–382.

[16]LI Y,SHAN X M,REN Y.Average path length of internet with power law degree distribution.Acta Physica Sinica,2004,53(11):3695–3700.(in Chinese)

[17]HASSANA S A,HEMEIDAB A M,MAHMOUDA M M M.Performance evaluation of matrix-matrix multiplications using Intel’s advanced vector extensions(AVX).Microprocessors and Microsystems,2016,47(B):369–374.

[18]STRASSEN V.Gaussian elimination is not optimal.Numerische Mathematik,1969,13(4):354–356.

[19]PAN V Y.New combinations of methods for the acceleration of matrix multiplications.Computers&Mathematics with Applications,1987,7(1):73–125.

[20]COPPERSMITH D,WINOGRAD S.Matrix multiplication viaarithmetic progressions.Journal of Symbolic Computation,1987,9(3):251–280.

[21]KHAN A H,AL-MOUHAMED M,FATAYER A,et al.Optimizing the matrix multiplication using Strassen and Winograd algorithms with limited recursions on many-core.International Journal of Parallel Programming,2016,44(4):801–830.

[22]STOTHERS A J.On the complexity of matrix multiplication.Edinburgh,UK:University of Edinburgh,2010.

[23]WILLIAMS V V.Multiplying matrices faster than coppersmith-winograd.Proc.of the 44th Annual ACM Symposium on Theory of Computing,2012:887–898.

[24]GALL L F.Powers of tensors and fast matrix multiplication.arXiv preprint arXiv,2014,1401:7714.

[25]ZENG X Z.Empirical study of Chinese airline network structure based on complex network theory.Nanjing,China:Nanjing University of Aeronautics and Astronautics,2011.(inChinese)