A New Algorithm to Decompose Large Networks

Zhao Rui-min; Zhuang Zhen-quan

您当前的位置：

首页 >

文章列表页 >

A New Algorithm to Decompose Large Networks

更新时间：2025-12-08

- A New Algorithm to Decompose Large Networks
- Acta Electronica Sinica Issue 2, Pages: 96-101(1988)
- 作者机构：
  
  1. 中国科学技术大学
  2. 中国科学技术大学合肥
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1988
- 稿件说明：
移动端阅览
[1]赵睿民,庄镇泉.大网络分解的一个新算法[J].电子学报,1988(02):96-101.

Zhao Rui-min, Zhuang Zhen-quan. A New Algorithm to Decompose Large Networks[J]. Acta Electronica Sinica, 1988, (2): 96-101.
[1]赵睿民,庄镇泉.大网络分解的一个新算法[J].电子学报,1988(02):96-101. DOI：

Zhao Rui-min, Zhuang Zhen-quan. A New Algorithm to Decompose Large Networks[J]. Acta Electronica Sinica, 1988, (2): 96-101. DOI：

摘要

本文提出一个新的基于伴随图的求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.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰