Some Experiments on Partitioning Big Sparse Graphs

摘要

When solving large systems of differential equations one could decompose the system into smaller subsystems and solve them in parallel. The report sets up a model for the partitioning problem using graphs, so the problem becomes a combinatorial optimization problem. It uses the simulated annealing method to solve the problem and give the numerical results obtained.