【摘要】 本文提出一个新的基于伴随图的求BBD分解的启发式算法。它在处理“大度数节点”时比目前已有的算法有明显的优点,能更好地完成划分子网络的工作。文中还介绍了根据这个算法所开发的通用电路分析程序和计算实例,给出了分解计算实例。更多还原

【Abstract】 A new heuristic algorithm for BBD decomposition based on adjoint graph is proposed. In handling nodes with large number of degree, it is more suprior to the algorithm which is often referenced in recent papers. It can be used to decompose large networks and get better results. Finally, a computational example of a general purpose circuit analysis program based on this algorithm is given.更多还原