Clique Percolation Method to extract communities for a graph network. [R implementation]
-
Updated
Jun 1, 2021 - R
#
clique-graph
Here are 20 public repositories matching this topic...
C implementation of finding Maximal and Maximum Clique Using Bron Kerbosch Algorithm
-
Updated
May 26, 2018 - C
Python3, NetworkX, Java, MLlib, Spark, Cassandra, Neo4j 3.0, Gephi, Docker
python docker spark cassandra neo4j bigdata lastfm community-detection music-recommendation python3 networkx mllib recommendation-system cosine-similarity gephi clique clique-graph networkx-graph louvain-method k-plex
-
Updated
Jul 18, 2017 - Roff
Repositório doProjeto Final de Análise de Algoritmos - 2024 - Natalia Almada e Matheus Melo - Problema do Clique
-
Updated
Sep 25, 2024 - C
CHoleR: a C++ Tool for the Analysis of Persistent Homology on Undirected Weighted Graphs [C++, CLI/CLR, JNI, WPF, C#]
cpp undirected-graphs bron-kerbosch-algorithm persistent-homology clique-graph graphtheory graph-plot weighted-graphs mcb cliques minimumcyclebasis mfcb depina amaldi
-
Updated
Jan 20, 2020 - C++
Collection of Assignments and Programs For CS 146: Data Structures and Algorithms
java algorithms quicksort data-structures np-complete insertion-sort sorting-algorithms dual-pivot-quicksort heap-algorithm merge-sort clique-graph maxheap
-
Updated
Jan 24, 2019 - Java
C++ algorithm to solve(or try to solve) the clique problem
-
Updated
Sep 1, 2017 - C++
A simple SAT solver written in Java
-
Updated
Jun 15, 2019 - Java
The program finds and displays all cliques with different densities in a given bipartite graph with variable density.
-
Updated
Jan 19, 2015 - C++
Compute n-sized cliques of words!
-
Updated
Apr 13, 2025 - Python
This repository contains a C++ implementation of an exact algorithm to find the densest subgraph based on h-clique densities in an undirected graph. It supports any h ≥ 2 and is tested on standard datasets like AS733 and Netscience.
c graph-algorithms cpp14 algorithms-implemented algorithms-and-data-structures clique-graph dataset-analysis subgraphs h-clique-densities
-
Updated
Mar 5, 2026 - C++
Este repositorio es una colección de algoritmos de grafos que abordan diversos problemas, incluyendo la detección de comunidades en redes, la búsqueda de la ruta más corta y la identificación de cubiertas de k-cliques.
-
Updated
Jun 4, 2024 - Python
Implementation of three fundamental algorithms in graph theory and Boolean logic: Satisfiability (SAT), Clique, and Independent Set. Each problem is addressed using various optimization and search techniques.
-
Updated
Sep 23, 2024 - Python
QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique
graph-algorithms high-performance-computing clique clique-graph clique-counting maximum-weighted-clique
-
Updated
Oct 25, 2024 - C++
An algorithm for solving the max clique problem
-
Updated
Aug 27, 2022 - C++
A collection of Python scripts to explore and visualize the B-Matrix of a graph network. Part of CPSC 547 (Information Visualization) 2022 at UBC.
benchmarking mesh-networks network matrix data-visualization infovis information-visualization networks network-analysis clique-graph small-world-networks infoviz network-comparison network-complexity b-matrix network-portrait
-
Updated
Dec 23, 2022 - Python
metaheuristic
graph graph-algorithms optimization network graph-theory local-search optimization-algorithms metaheuristics grasp clustering-coefficient clique-graph smallworld metaheuristic-optimisation clique-relaxation
-
Updated
Jan 21, 2021 - C++
This repository implements three maximal clique enumeration algorithms from notable research papers. Optimized for sparse and dense graphs, it includes C/C++ code with sample datasets for benchmarking and runtime analysis.
c cpp14 enumeration research-paper algorithms-implemented optimization-algorithms bron-kerbosch-algorithm algorithms-and-data-structures clique-graph maximal-cliques-finding dataset-analysis dense-graph
-
Updated
Mar 5, 2026 - HTML
Graph builder for Ripple consensus simulator
-
Updated
Mar 1, 2026 - Java
Implementation of branch and cut algorithm for maximum clique problem
-
Updated
Dec 30, 2017 - C++
Improve this page
Add a description, image, and links to the clique-graph topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the clique-graph topic, visit your repo's landing page and select "manage topics."