A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Articolo
Articolo
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to const...
Idioma Inglés
Página del recurso disponiblePágina de referencia del recurso. El texto completo no está confirmado automáticamente.
Página del recurso