Graph partitioning based methods and tools for scientific computing

DOI10.1016/S0167-8191(96)00102-0zbMath0906.68105OpenAlexW2089457912MaRDI QIDQ1392232

François Pellegrini

Publication date: 23 July 1998

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(96)00102-0

zbMATH Keywords

domain decompositiongraph partitioningstatic mappingdual recursive bipartitioning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic

Uses Software

• Scotch

This page was built for publication: Graph partitioning based methods and tools for scientific computing