Lock-Gain Based Graph Partitioning

ISSN： 1381-1231

Source： Journal of Heuristics, Vol.10, Iss.1, 2004-01, pp. : 37-57

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

Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes

By Walshaw C. Cross M. Everett M.G.

Journal of Parallel and Distributed Computing, Vol. 47, Iss. 2, 1997-12 ,pp. : 102-108

Academic Press

Access to resources Recommend Favorite

Lock Coarsening: Eliminating Lock Overhead in Automatically Parallelized Object-Based Programs

By Diniz P.C. Rinard M.C.

Journal of Parallel and Distributed Computing, Vol. 49, Iss. 2, 1998-03 ,pp. : 218-244

Academic Press

Access to resources Recommend Favorite

A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning

By Soper A.J. Walshaw C. Cross M.

Journal of Global Optimization, Vol. 29, Iss. 2, 2004-06 ,pp. : 225-241

Springer Publishing Company

Access to resources Recommend Favorite

Linear and quadratic programming approaches for the general graph partitioning problem

By Fan Neng Pardalos Panos

Journal of Global Optimization, Vol. 48, Iss. 1, 2010-09 ,pp. : 57-71

Springer Publishing Company

Access to resources Recommend Favorite

A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering

By Karypis G. Kumar V.

Journal of Parallel and Distributed Computing, Vol. 48, Iss. 1, 1998-01 ,pp. : 71-95

Academic Press

Access to resources Recommend Favorite