%0 Journal Article
%T Formal derivation of graph algorithmic programs using partition-and-recur<br>Formal Derivation of Graph AlgorithmicPrograms Using Partition-and-Recur
%A Xue Jinyun
%A <br>Xue
%A Jinyun
%J 计算机科学技术学报
%D 1998
%I 
%X In this paper, we derive, by presenting some suitable notations, three typical graph aLgorithms and corresponding programs using a unified approach, partition-and-recur. We putemphasis on the derivation rather than the algorithms themselves. The main ideas and lugesnutty of these algorithms are revealed by formula deduction. Success in these examples givesus more evidence that partition-and-recur is a simple and practical approach and developingenough suitable notations is the key in designing and deriving efficient and correct algorithmicprograms.
%K Graph Algorithms
%K method of algorithm design
%K program derivation
%K formalmethod<br>程序设计
%K 图形算法
%K 算法设计方法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=0BD724EC006C854F5A29C8FEF6263EC6&yid=8CAA3A429E3EA654&vid=FC0714F8D2EB605D&iid=B31275AF3241DB2D&sid=4AB4178709047BE3&eid=B4F9D541F855CF96&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=11&reference_num=16