论文信息 - Optimizing in Graphs with Expensive Computation of Edge Weights - 字舞流文

Optimizing in Graphs with Expensive Computation of Edge Weights

Much research has gone into the development of fast graph optimization algorithms and many problems, such as shortest-path [1] or minimum-cut

Gerhard Reinelt | Marcus Oswald | Frank Noé | G. Reinelt | F. Noé | M. Oswald

[1] Toshihide Ibaraki,et al. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[2] Jeremy C. Smith,et al. Transition Networks for the Comprehensive Characterization of Complex Conformational Change in Proteins. , 2006, Journal of chemical theory and computation.

[3] Gerhard Reinelt,et al. Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the AlphaL \leftrightharpoons Beta \leftrightharpoons AlphaR Transitions in Octaalanine , 2006, Multiscale Model. Simul..

[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.