|
Graph Partitioners

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.cs.cmu.edu/~scandal/alg/separator.html | |
|
|
|
| Guy Blelloch | |
| 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.) | |
|
|
|
| Levels: | College |
| Languages: | English |
| Resource Types: | Topic Tools Miscellaneous |
| Math Topics: | Algorithms, Graph Theory |
[Privacy Policy] [Terms of Use]


© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.