Parallel algorithms for the minimum cut and the minimum length tree layout problems

By Diaz J.   Gibbons A.   Pantziou G.E.   Serna M.J.   Spirakis P.G.   Toran J.  

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 267-287

Elsevier

Access to resources Recommend Favorite

Algorithms and analysis of scheduling for loops with minimum switching

By Shao Zili   Zhuge Qingfeng   Liu Meilin   Xue Chun   Sha Edwin H.M.   Xiao Bin  

International Journal of Computational Science and Engineering, Vol. 2, Iss. 1-2, 2006-06 ,pp. : 88-97

Inderscience Publishers

Access to resources Recommend Favorite

Approximated algorithms for the minimum dilation triangulation problem

By Dorzán Maria   Leguizamón Mario   Mezura-Montes Efrén   Hernández-Peñalver Gregorio  

Journal of Heuristics, Vol. 20, Iss. 2, 2014-04 ,pp. : 189-209

Springer Publishing Company

Access to resources Recommend Favorite

New Approximation Algorithms for Minimum Cycle Bases of Graphs

By Kavitha Telikepalli   Mehlhorn Kurt   Michail Dimitrios  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 471-488

Springer Publishing Company

Access to resources Recommend Favorite

Efficient parallel algorithms for numerical simulation

By Lecomber D.   Rudgyard M.  

Future Generation Computer Systems, Vol. 17, Iss. 8, 2001-06 ,pp. : 961-967

Elsevier

Access to resources Recommend Favorite