Scholarly and Creative Works
2025
- Bradley, C. L., Akathoott, A. M., & Burtscher, M. (2025). F-Diam: A Code for Quickly Computing the Exact Diameter of Large Sparse Graphs. Retrieved from https://github.com/burtscher/F-Diam
- Bradley, C. L., & Burtscher, M. (2025). Fringe-SGC: High-Speed Code for Counting the Number of Occurrences of a Subgraph. Retrieved from https://github.com/burtscher/Fringe-SGC
- Bradley, C. L., Alabandi, G. A. H., & Burtscher, M. (2025). Fringe-SGC: Counting Subgraphs with Fringe Vertices. https://doi.org/10.1145/3712285.3759839
- Bradley, C. L., Akathoott, A. M., & Burtscher, M. (2025). Fast Exact Diameter Computation of Sparse Graphs. https://doi.org/10.1145/3754598.3754620