FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets
-
Updated
Jun 2, 2025 - C++
FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets
Maximum independent set problem - greedy and brute force parallel algorithms
Implementation of LubyMIS algorithm to find the Maximal Independent Set in case of distributed networks
QUANTUM-POWERED PLANNER FOR EV CHARGING NETWORKS: Greening the road ahead: Charging demand location model for sustainable electric vehicle adoption.
Add a description, image, and links to the maximal-independent-set topic page so that developers can more easily learn about it.
To associate your repository with the maximal-independent-set topic, visit your repo's landing page and select "manage topics."