| 应用超图理论实现有向基本割集矩阵 |
| |
| 引用本文： | 黄汝激.应用超图理论实现有向基本割集矩阵[J].电子与信息学报,1992,14(1):50-60. |
| |
| 作者姓名： | 黄汝激 |
| |
| 作者单位： | 北京科技大学自动化系 北京 |
| |
| 摘 要： | 本文应用超图理论提出了从有向基本割集矩阵Qf的树路子阵Qfp逐层判断其可实现性和综合出其对应有向图(G)的算法RFCMHGT。它的原理直观,计算复杂度为O(nl2),n和l为Qfp的行和列数。例2表明,Tutte条件不是Qf可实现的充分条件。
|
| 关 键 词： | 网络拓扑综合 超图 有向图 |
| 收稿时间： | 1990-6-22 |
| 修稿时间： | 1991-5-24 |
REALIZATION OF DIRECTED FUNDAMENTAL CUTSET MATRIX BY HYPERGRAPH THEORY |
| |
| Huang Ruji.REALIZATION OF DIRECTED FUNDAMENTAL CUTSET MATRIX BY HYPERGRAPH THEORY[J].Journal of Electronics & Information Technology,1992,14(1):50-60. |
| |
| Authors: | Huang Ruji |
| |
| Institution: | Beijing University of Science and Technology Beijing 100083 |
| |
| Abstract: | By applying hypergraph theory, algorithm RFCMHGT is presented fordetermining the realizability of a given directed fundamental cutset matrix Qf and synthesizing its corresponding directed graph G layer by layer from its tree path submatrix Qfp. Its principle is intuitive and its computational complexity is O(nl2). where n and l are the numbers of rows and columns of Qfp. Example 2 shows that Tutte's condition is not the sufficient condition for Qf to be realizable. |
| |
| Keywords: | Network topological synthesis Hypergraph Directed graph |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
| 点击此处可从《电子与信息学报》下载免费的PDF全文 |
