摘要
在Mayeda 的由矩阵实现为图的方法中,当存在多个H 子矩阵时形成一对M 子矩阵较困难,对此,该文研究了连通块的连接性质,提出了利用连通块的邻接概念对H 子矩阵进行分类判断,解决了在各种情况下一对 M 子矩阵的形成问题。该文又提出了图实现的成对分解法,它不但具有Mayeda 方法的优点,而且适用性和实用性更强,简便有效。
In Mayeda's method from matrix to graph, there is a difficulty in forming a pair M submatrix, with many H submatrixs. For this reason, connection properties of connected block is studied in this paper. The adjacency concept of connected block mentioned here is used to do the classified judgement of H submatrixes, thus solving the formation of a pair M submatrix in various cases. Decomposing method in pair of graph-realization is also presented. The method has both advantages of Mayeda's method and more adaptable,practicable,convenient and effective.
出处
《南京理工大学学报》
EI
CAS
CSCD
1999年第6期494-498,共5页
Journal of Nanjing University of Science and Technology