Xiong Deyan. ON CIRCUIT VECTOR SPACE APPROACH FOR GENERATING ALL DIRECTED CIRCUITS OF A DIGRAPH[J]. Journal of Electronics & Information Technology, 1989, 11(1): 21-27.
Citation:
Xiong Deyan. ON CIRCUIT VECTOR SPACE APPROACH FOR GENERATING ALL DIRECTED CIRCUITS OF A DIGRAPH[J]. Journal of Electronics & Information Technology, 1989, 11(1): 21-27.
Xiong Deyan. ON CIRCUIT VECTOR SPACE APPROACH FOR GENERATING ALL DIRECTED CIRCUITS OF A DIGRAPH[J]. Journal of Electronics & Information Technology, 1989, 11(1): 21-27.
Citation:
Xiong Deyan. ON CIRCUIT VECTOR SPACE APPROACH FOR GENERATING ALL DIRECTED CIRCUITS OF A DIGRAPH[J]. Journal of Electronics & Information Technology, 1989, 11(1): 21-27.
An algorithm is presented for generating all directed circuits of a directed graph by the linear combination in the basic set of (1) the directed or (2) the oriented circiuts. A theorem named principle of equality between numbers of edges and vertices is proved. Based on this pringiple a simple method is worked out. Using it to identify the directed circuits makes the running time of the algorithm for digraphs being mainly the same as for undirected graphs.
N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall Inc, Englewood Cliffs, N. J. 1974, pp287-290.[2]熊德琰,电子学报,1986年,第6期,第42-47页.[3]Y. M. Wu.[J].K. T. Chiu, S. P. Chan, On Transformations among Network Matrices, Proc.16th Asilomar Conf. on Circiuts, Systems and Computers.1982,:-[4]陈树柏,左垲,张良震等编,网络图论及其应用,科学出版社,北京,1982,第117-121页.[5]P. Mateti, N. Deo, SIAM J.Comput., 5(1976)1, 90-99.
DownLoad: