Branch and cut algorithms for detecting critical nodes in undirected graphs

By Di Summa Marco  

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 649-680

Springer Publishing Company

Access to resources Recommend Favorite

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time

By Weihe K.  

Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. : 121-138

Academic Press

Access to resources Recommend Favorite

Exploring the Chemical Space of Known and Unknown Organic Small Molecules at www.gdb.unibe.ch

By Reymond Jean-Louis  

CHIMIA International Journal for Chemistry, Vol. 65, Iss. 11, 2011-11 ,pp. : 863-867

Swiss Chemical Society

Access to resources Recommend Favorite

Locating Sources to Meet Flow Demands in Undirected Networks

By Arata K.   Iwata S.   Makino K.   Fujishige S.  

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 54-68

Elsevier

Access to resources Recommend Favorite

A new strategy for the undirected two-commodity maximum flow problem

By Sedeño-Noda A.   González-Martín C.   Alonso-Rodríguez S.  

Computational Optimization and Applications, Vol. 47, Iss. 2, 2010-10 ,pp. : 289-305

Springer Publishing Company

Access to resources Recommend Favorite