暂无分享,去创建一个
[1] Nenad Trinajstić,et al. Graph theory and molecular orbitals. VII. The role of resonance structures , 1974 .
[2] Kurt Mehlhorn,et al. An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs , 2008, Algorithmica.
[3] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .
[4] J. C. D. Pina. Applications of shortest path methods , 1995 .
[5] Kurt Mehlhorn,et al. Breaking the O(m2n) Barrier for Minimum Cycle Bases , 2009, ESA.
[6] Kurt Mehlhorn,et al. An Õ(mn) Algorithm for Minimum Cycle Basis of Graphs∗ , 2004 .
[7] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[8] Milan Randic,et al. Resonance energy of very large benzenoid hydrocarbons , 1980 .
[9] Narsingh Deo,et al. Algorithms for Generating Fundamental Cycles in a Graph , 1982, TOMS.
[10] Narsingh Deo,et al. On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..
[11] Sven de Vries,et al. Minimum Cycle Bases for Network Graphs , 2004, Algorithmica.
[12] N. Trinajstic. Chemical Graph Theory , 1992 .
[13] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..
[14] Joseph Douglas Horton,et al. A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid , 2002, SWAT.
[15] Gary L. Miller,et al. Finding Small Simple Cycle Separators for 2-Connected Planar Graphs , 1986, J. Comput. Syst. Sci..
[16] Kurt Mehlhorn,et al. Minimum cycle bases: Faster and simpler , 2009, TALG.
[17] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[18] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[19] David Hartvigsen,et al. The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs , 1994, SIAM J. Discret. Math..
[20] S. E. Goodman,et al. An algorithm for the longest cycle problem , 1976, Networks.
[21] Joseph Douglas Horton,et al. A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..
[22] Kurt Mehlhorn,et al. Cycle bases in graphs characterization, algorithms, complexity, and applications , 2009, Comput. Sci. Rev..
[23] David Thomas,et al. The Art in Computer Programming , 2001 .
[24] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[25] Vijay V. Vazirani,et al. Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[26] Sven de Vries,et al. Minimum Cycle Bases and Their Applications , 2009, Algorithmics of Large and Complex Networks.
[27] Maciej M. Syslo,et al. On cycle bases of a graph , 1979, Networks.
[28] L. Kiepert. Ueber die Auflösung der Gleichungen fünften Grades , 1878 .
[29] Vijay V. Vazirani,et al. Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..