%0 Journal Article
%T AN EFFICIENT CIRCUIT VECTOR SPACE ALGORITHM FOR GENERATING ALL DIRECTED CIRCUITS OF A DIGRAPH<br>生成有向图全部有向回路的一个有效的回路向量空间算法
%A Xiong Deyan
%A <br>熊德琰
%J 电子与信息学报
%D 1987
%I 
%X In this paper, an efficient circuit vector space algorithm is presented for enumerating directed circuits of a directed graph, by which every directed circuit is generated by the ring-sum of a fundamental circuit (directed circuit or semi-circuit) defined by a chord of the-cotree and a subset of the previously obtained directed circuits. At the same time every directed circuit in the digraph can be represented by a linear combination of a selected basic set of directed circuits.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=2A6629FF47FC3585&yid=9C2DB0A0D5ABE6F8&vid=9CF7A0430CBB2DFD&iid=B31275AF3241DB2D&sid=283B38DAD0D068F3&eid=F176272DD933A0BB&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=9