The Completion and Algorithm of the Partial Inverse M-Matrix Whose Graph is a Ω-tree

摘要：

The Completions of Inverse M-matrices Patterns have been discussed widely. But the researches are all aimed at the patterns whose entries in diagonal positions are all specified. In the paper, we will drop the condition and mark the diagonal entries about its specified or unspecified. We will discuss the completion theorem and algorithm of the partial

关键词： inverse M-matrix whose graph is a Ω -tree. completion cycle clique Ω -tree

作者: NaiHua. Ji Huiping.Yao Yingjie.Wang

作者单位: Computer Engineering Institute, Qingdao Technological University Qingdao Shandong School of Science Qingdao Technological University Qingdao Shandong Information Science and Engineering Institute Dalian University Dalian Liaoning

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Automation Engineering(ICCAE 2011)(2011年第三届IEEE计算机与自动化工程国际会议)

会议地点: 重庆

会议语种:英文

页码: 472-474

在线出版日期: 2011-01-21（万方平台首次上网日期，不代表论文的发表时间）