Fast algorithms on 2 dimensional rigidity and (k,l)-sparsity matroids. M-component hypergraph, transversal on the MCT sets and redundant augmentation in O(|V|^2) time and O(|V|) memory.
-
Updated
Dec 14, 2024 - C++
Fast algorithms on 2 dimensional rigidity and (k,l)-sparsity matroids. M-component hypergraph, transversal on the MCT sets and redundant augmentation in O(|V|^2) time and O(|V|) memory.
Add a description, image, and links to the matroid topic page so that developers can more easily learn about it.
To associate your repository with the matroid topic, visit your repo's landing page and select "manage topics."