Maximum independent sets and vertex covers of large sparse graphs.
-
Updated
Apr 15, 2026 - C++
Maximum independent sets and vertex covers of large sparse graphs.
Exact minimum cuts in hypergraphs at scale using FPT kernelization
Contains various machine learning algorithms and their implementations.
FPT-based data reduction and kernelization for the maximum cut problem
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.
To associate your repository with the kernelization topic, visit your repo's landing page and select "manage topics."