Maximum independent sets and vertex covers of large sparse graphs.
-
Updated
Jul 8, 2025 - C++
Maximum independent sets and vertex covers of large sparse graphs.
Contains various machine learning algorithms and their implementations.
Parallel Implementation of some Kernelization algorithms specifically for solving K-Clique problems
Documented experiment for wine quality prediction through SVM, KSVM, LR and KLR. Implementation of SVM and Logistic Regression models [with optional non-linear kernelization] from scratch. Implementation of K-Fold cross validation for hyperparameter tuning. Implementation of PCA for dimensionality reduction.
Add a description, image, and links to the kernelization topic page so that developers can more easily learn about it.
To associate your repository with the kernelization topic, visit your repo's landing page and select "manage topics."