| 几类具有可分解结构图的最小填充数 |
| |
| 引用本文： | 王晓燕,杨俊元.几类具有可分解结构图的最小填充数[J].河南科技大学学报(自然科学版),2009,30(1). |
| |
| 作者姓名： | 王晓燕 杨俊元 |
| |
| 作者单位： | 运城学院,应用数学系,山西,运城,044000 |
| |
| 摘 要： | 在计算数学领域,稀疏矩阵的最小填充问题由于其重要的实际意义而受重视.本文从图论的观点提出一种方法,即利用图的分解约化定理给出了麻花图,火箭图,网图等的填充数表达式,从而为确定这些图类的填充奠定了基础,并提出进一步的建议.
|
| 关 键 词： | 填充 图 消去 最优顺序 |
Minimum Fill-in of Some Special Graphs with Decomposition |
| |
| WANG Xiao-an,YANG Jun-Yuan.Minimum Fill-in of Some Special Graphs with Decomposition[J].Journal of Henan University of Science & Technology:Natural Science,2009,30(1). |
| |
| Authors: | WANG Xiao-an YANG Jun-Yuan |
| |
| Institution: | Department of Mathematics;Yuncheng University;Yuncheng 044000;China |
| |
| Abstract: | The minimum fill-in problem for graphs,raised from analysis,is to study the optimum elimination ordering in spare matrix computations.The minimum fill-in of some special graphs,such as twist graph,rocket graph and net graph is studied.It is theoretical basis for future research. |
| |
| Keywords: | Fill-in Graph Elimination Optimal ordering |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
