Graph Partitioning and Sequencing Software
Graph partitioning is a fundemental problem in many scientific contexts. CHACO2.0 is a software package designed to partition and sequence graphs. CHACO2.0 allows for recursive application of several methods for finding small edge separators in weighted graphs. These methods include inertial, spectral, Kernighan Lin and multilevel methods in addition to several simpler strategies. Each of these approaches can be used to partition the graph into two, four, or eight pieces at each level of recursion. In addition, the Kernighan Lin method can be used to improve partitions generated by any of the other algorithms. CHACO2.0 can also be used to address various graph sequencing problems, with applications to scientific computing, database design, gene sequencing and other problems.
- Short Name / Acronym:
- CHACO2.0; 001132SUN0000
- Version:
- 00
- Programming Language(s):
- Medium: X; OS: Any Unix operating system; Compatibility: Any with Unix operating system
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- DOE/DP
- DOE Contract Number:
- P
- OSTI ID:
- 1230367
- Country of Origin:
- United States
Similar Records
Parallel incremental graph partitioning using linear programming
Efficient multiple-way graph partitioning algorithms