Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
Many algorithms use data structures that maintain properties of matrices undergoing some changes. The applications are wide-ranging and include for example matchings, shortest paths, linear programming, semi-definite programming, convex hull and volume computation. Given the wide range of applications, the exact property these data structures must maintain varies from one …