共 12 条
[1]
Berlekamp, McEliece, van Tilborg, On the inherent intractability of certain coding problems, IEEE Transactions on Information Theory, 24, pp. 384-386, (1978)
[2]
Cribb, Ringeisen, Shier, On cycle bases of a graph, Congr. Numer., 32, pp. 221-229, (1981)
[3]
Deo, Minimum length fundamental cycle set, IEEE Trans. Circuits and Systems, 26, pp. 894-895, (1979)
[4]
Deo, Prabhu, Krishnamoorthy, Algorithms for generating fundamental cycles in a graph, ACM Transactions on Mathematical Software, 8, pp. 26-42, (1982)
[5]
Horton, A polynomial-time algorithm to find the shortest cycle basis of a graph, SIAM J. Comput., 16, pp. 358-366, (1987)
[6]
Hubicka, Syslo, Minimal bases of cycles of a graph, Proc. Symp. on Recent Advances in Graph Theory, pp. 283-293, (1975)
[7]
Kolasinska, On a minimum cycle basis of a graph, Zastos. Mat., 16, pp. 631-639, (1980)
[8]
Lauritzen, Spiegelhalter, Local comomputations with probabilities on graphical structures and their application to expert system, J. Roy. Statist. Soc. Ser. B, 50, pp. 157-224, (1988)
[9]
Stepanec, Basis systems of vector cycles with extremal properties in graphs, Uspekhi Mat. Nauk, 19, pp. 171-175, (1964)
[10]
Syslo, On cycle bases of a graph, Networks, 9, pp. 123-132, (1979)