Published April 25, 2025 | Version 1.0.0

ParAMD: Parallel Approximate Minimum Degree Algorithm

  • 1. ROR icon University of California, Berkeley
  • 2. ROR icon Lawrence Berkeley National Laboratory

Contributors

Contact person:

  • 1. ROR icon University of California, Berkeley
  • 2. ROR icon Lawrence Berkeley National Laboratory

Description

ParAMD is a shared memory parallel implementation of the approximate minimum degree (AMD) algorithm with multiple elimination via distance-2 independent sets.

For more information, please read our preprint paper Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation on arXiv and the README file.

Files

ParAMD-main.zip

Files (941.0 kB)

Name Size
md5:483906c7b5e815f0cdb89b2449d86323
941.0 kB Preview Download

Additional details

Dates

Available
2025-04-25

Software

Repository URL
https://github.com/PASSIONLab/ParAMD
Programming language
C++
Development Status
Active