Circuit bases of strongly connected digraphs
暂无分享,去创建一个
[1] Ali Kaveh,et al. Structural Mechanics: Graph and Matrix Methods , 1995 .
[2] Philippe Vismara,et al. Union of all the Minimum Cycle Bases of a Graph , 1997, Electron. J. Comb..
[3] Renzo Balducci,et al. Efficient exact solution of the ring perception problem , 1994, J. Chem. Inf. Comput. Sci..
[4] Donald B. Johnson,et al. Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..
[5] Hans Schneider,et al. Integral bases and p-twisted digraphs , 1995, Eur. J. Comb..
[6] Leon O. Chua,et al. On optimally sparse cycle and coboundary basis for a linear graph , 1973 .
[7] David Hartvigsen,et al. When Do Short Cycles Generate the Cycle Space? , 1993, J. Comb. Theory, Ser. B.
[8] Peter F. Stadler,et al. Relevant cycles in Chemical reaction Networks , 2001, Adv. Complex Syst..
[9] M. N. Shanmukha Swamy,et al. Graphs - theory and algorithms , 1992 .
[10] D. Fell. Understanding the Control of Metabolism , 1996 .
[11] Michael F. Lynch,et al. Review of Ring Perception Algorithms for Chemical Graphs. , 1989 .
[12] P. Vismara. Reconnaissance et représentation d'éléments structuraux pour la description d'objets complexes : application à l'élaboration de stratégies de synthèse en chimie organique , 1995 .
[13] David Hartvigsen,et al. Minimum Path Bases , 1993, J. Algorithms.
[14] Joseph Douglas Horton,et al. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..
[15] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[16] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[17] David Hartvigsen,et al. The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs , 1994, SIAM J. Discret. Math..
[18] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[19] Dănuţ Marcu,et al. On finding the elementary paths and circuits of a digraph , 1991 .