%0 Journal Article
%T ON THE NUMBER OF SOLUTIONS OF CERTAI<br>寻找无向图中回路的并行算法
%A MA Jun
%A Kazuo Iwama
%A MA Shaohan
%A <br>马军
%A 岩间一雄
%A 马绍汉
%J 软件学报
%D 1997
%I 
%X Let G=(V,E),|V|=n,|E|=m, be an undirected simple graph, NC algorithms are given for following problems: (1) finding a shortest circuit in G ; (2) finding a shortest circuit of even (odd) length in G ; and (3) finding a C k , k =3,4, where C k is the circuit in G of k edges.
%K Graph algorithms
%K cycle
%K shortest circuits
%K parallel algorithms<br>图论算法
%K 回路
%K 最短回路
%K 并行算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=F1B2A1CD9439F1D8EAE412B8B25500C1&yid=5370399DC954B911&vid=5D311CA918CA9A03&iid=B31275AF3241DB2D&sid=D93AD940782892D0&eid=03436AC72A659ACA&journal_id=1000-9825&journal_name=软件学报&referenced_num=3&reference_num=17