Library Home || Full Table of Contents || Suggest a Link || Library Help
|Three algorithms written in NESL for finding separators of graphs, for the purpose of comparing the quality of the cuts. From the Scandal Project on developing a portable, interactive environment for programming a wide range of supercomputers (see Implementations of Irregular Parallel Algorithms.)|
|Resource Types:||Topic Tools Miscellaneous|
|Math Topics:||Algorithms, Graph Theory|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.