algorithm - METIS serial graph partitioner -
metis graph partitioning algorithm used partitioning large graph. have graph forest. know how metis partitions in case ?
well, indeed, metis can partition large graphs doesn't mean can not manage smaller graphs or different types of graphs.
forest special type of graph without cycles, can have disconnected parts...
as other type of graph, metis going perform 3 level partitioning algorithm:
coarsening (in case, have forest graph, may finish because type of graph going have small number of edges or connections)
initial partitioning
uncoarsening + fine-grained balancing.
so basically, going work type of graph.
and personal experience, did find out metis didn't give me optimal results when working disconnected graphs (and forest disconnected graph), implemented own logic finding groups of vertices connected , used metis partition group (which connected)...
i recommend reading metis metis library documentation.
Comments
Post a Comment