Markus G. Wloka

Learn More
We have extended the Mob heuristic for graph partitioning [21] to grid and hypercube embedding and have e ciently implemented our new heuristic on the CM-2 Connection Machine. We have conducted an extensive series of experiments to show that it exploits parallelism, is fast, and gives very low embedding costs. For example, on the 32K-processor CM-2 it runs(More)
We have extended the Mob heuristic for graph partitioning [21] to grid and hypercube embedding and have e ciently implemented our new heuristic on the CM-2 Connection Machine. We have conducted an extensive series of experiments to show that it exploits parallelism, is fast, and gives very low embedding costs. For example, on the 32K-processor CM-2 it runs(More)
  • 1