摘要
在计算机教学领域,稀疏矩阵的最小填充问题由于其重要的实际意义而受重视.本文从图论的观点提出一种处理方法,即利用图的分解约化定理给出了铅笔图和蜘蛛图的填充数表达式,从而为确定这引起图类的填充奠定了基础,并提出进一步研究的建议.
The minimum fill-in problem for graphs, raised from numerical analysis, is to study the optimum elimination ordering in spare matrix computations. The minimum fill-in of some special graphs, such as pencil graph and spider graph is studied. It is theoretical basis of future research.
出处
《山西师范大学学报（自然科学版）》
2008年第3期21-23,共3页
Journal of Shanxi Normal University(Natural Science Edition)
基金
运城学院院级科研项目(20060216)
关键词
填充
图
消去
fill-in
graph
elimination
