The following software artifacts (and more) can be found at my GitHub repository.
TreeSearch | An abstract implementation of a backtracking search to allow automatic parallel job generation. Includes scripts for input/output management on a grid using the Condor scheduler. Forms the base of all other projects in SearchLib. | Source | User Guide |
Utilities | This package contains classes, methods, and executables that are used by other projects. | Source | |
EarSearch | Generates 2-connected graphs by ear decompositions using an isomorph-free generation scheme. Requires: nauty. | Source | User Guide |
ChainCounting | Generates width-two posets and counts the number of chains in each, searching for representations of all positive integers. Found representations for all integers up to 7.38 million. Joint work with Elizabeth Kupin and Benjamin M. Reiniger. | Source | User Guide |
Saturation | Generates uniquely K_{r}-saturated graphs using a custom augmentation. Uses orbital branching or isomorph-free generation. Found several new graphs of orders 13, 15, 16, and 18 and a new infinite family. Requires: nauty and cliquer. Joint work with Stephen G. Hartke. | Source | User Guide |
Progressions | Searches for extremal colorings of [n] which avoid different types of progressions which generalize arithmetic progressions. Also restricts to symmetric colorings of [n]. Joint work with Adam S. Jobson and André E. Kézdy. | Source | User Guide |
MMSConjecture | Searches for vectors of $n$ real numbers with non-negative sum while minimizing the number of non-negative partial $k$-sums. Verifies the Manickam-Miklós-Singhi Conjecture for $k \leq 7$. Joint work with Stephen G. Hartke. | Source | User Guide |
The ADAGE Framework is available as open-source software. You can find the most-recent version at the GitHub page. You can also download the software here:
strong_edge_reducible | Test if a configuration is reducible, specifically for strong edge colorings. Code includes methods for vertex coloring. | Source | Research Project |
distance_cliquer | Computes the independence ratio of a distance graph $G(S)$ using an implementation of Niskanen and Ostergard's cliquer algorithm. | Source | Research Project |