Parallel Heuristics for Improved, Balanced Graph Colorings

Author： Gjertsen Jr R.K.   Jones M.T.   Plassmann P.E.  

Publisher： Academic Press

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.37, Iss.2, 1996-09, pp. : 171-186

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Heuristics for Semirandom Graph Problems

By Feige U.   Kilian J.  

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 639-671

Academic Press

Access to resources Recommend Favorite

A Parallel Multilevel Metaheuristic for Graph Partitioning: Special Issue: New Advances on Parallel Meta-Heuristics for Complex Problems (Guest Editor: Enrique Alba)

By Baños R.   Gil C.   Ortega J.   Montoya F.G.  

Journal of Heuristics, Vol. 10, Iss. 3, 2004-05 ,pp. : 315-336

Springer Publishing Company

Access to resources Recommend Favorite

An analysis of some linear graph layout heuristics

By Cimikowski Robert  

Journal of Heuristics, Vol. 12, Iss. 3, 2006-05 ,pp. : 143-153

Springer Publishing Company

Access to resources Recommend Favorite

Task assignment heuristics for parallel and distributed CFD applications

By Lopez-Benitez Noe   Djomehri M. Jahed   Biswas Rupak  

International Journal of Computational Science and Engineering, Vol. 3, Iss. 2, 2007-11 ,pp. : 155-165

Inderscience Publishers

Access to resources Recommend Favorite

Improved convergent heuristics for the 0-1 multidimensional knapsack problem

By Hanafi Saïd  

Annals of Operations Research, Vol. 183, Iss. 1, 2011-03 ,pp. : 125-142

Springer Publishing Company

Access to resources Recommend Favorite