An algorithm proving the resource-allocation-graph algorithm

doi:10.1109/ICISS.2010.5655444

	An algorithm proving the resource-allocation-graph algorithm
	Wang, Jikui1 ; Tang, Shijie 2; Wang, Huiyong 2
	2010
会议录名称	Proceedings - 2010 International Conference on Intelligent Computing and Integrated Systems, ICISS2010
页码	613-615
出版者	IEEE Computer Society
摘要	By analyzing the resource allocation graph algorithm, we state that the soundess of the algorithm depends on a fact: different simplification sequences of the resource allocation graph lead to a same Non-reducible graph. By analyzing the essence of the resource allocation algorithm, we give another algorithm to verify the resource-allocation-graph algorithm. © 2010 IEEE.
关键词	Intelligent computing Graph algorithms Non-reducible Reducible graph Resource allocation algorithms Simplification sequence
DOI	10.1109/ICISS.2010.5655444
收录类别	EI
语种	英语
EI入藏号	20110313596104
文献类型	会议论文
条目标识符	http://ir.lzufe.edu.cn/handle/39EH0E1M/9870
专题	信息工程与人工智能学院
作者单位	1.Lanzhou University of Finance and Economics, Lanzhou, China; 2.Guilin University of Electronic Technology, Guilin, Guangxi, China
推荐引用方式 GB/T 7714	Wang, Jikui,Tang, Shijie,Wang, Huiyong. An algorithm proving the resource-allocation-graph algorithm[C]:IEEE Computer Society,2010:613-615.