摘要
针对最小化边连接集分解法所存在的问题,提出了一种新的BBD(加边对角)形式的边分解法,它包括相对最小化边连接集概念及其判别与判别定理,以及新的边分解方法两部分。与原分解方法比较,分解结果更为合理,分解速度更快,还给出了改进的数据结构、程序框图和分解实例。
A new BBD form of border decomposition algorithm is proposed,in which the conceptof relative minimized border connected subnetwork and its discrimination and a simplifiedtheorem are included. Compared with those obtained with the existing decomposition algo-rithm,the decomposition results are more reasonable and the decomposition speed is higher.The improved data structure,the flow chart and examples are given.
出处
《华中理工大学学报》
CSCD
北大核心
1995年第8期121-124,共4页
Journal of Huazhong University of Science and Technology
关键词
BBD
边分解
最小化边连接集
数据结构
网络
BBD
border decomposition
relative minimized border connected subnetwork
improved data structure