clique

🍊 🕸 Network analysis add-on for Orange data mining suite.

Implementation of branch and bound algorithm for maximum clique problem

Clique Percolation Method to extract communities for a graph network. [R implementation]

Genetic Algorithm for the Maximum Clique Problem

Python3, NetworkX, Java, MLlib, Spark, Cassandra, Neo4j 3.0, Gephi, Docker

The Mordor proof-of-work testnet for Ethereum Classic.

Use this template to start Proof of Authority (Clique) network on your kubernetes cluster or locally on minikube using geth.

Clique (EIP225 Proof-of authority concensus) Engine implementation for Parity

Implementation of branch and bound algorithm for maximum clique problem with cplex

Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization

The Kotti proof-of-authority testnet for Ethereum Classic.

Creates a group of related functions from a naming function, a value deriver function, and an array of primitive values.

Run a bunch of Quorum nodes, each in a separate Docker container. support istanbul and clique consensus.

Community detection programming exercises for the SMA-17s course

Orthogonal Oligo Design for Fluorescence In Situ Hybridization (a.k.a. OOD-FISH)

A platform to promote entrepreneurship and collaboration amongst college students. CliqueIO provides an efficient and easy way to quickly get their ideas out in the open. CliqueIO creates an enviroment for college entrepreneurs to recruit their peers to build out the next big tech startup. CliqueIO comes with a wide array of tools and processes to make the process as smooth as possible.

Here is the documentation related to the "mrcp-project" repository for the final degree project in software engineering.

Randomized Heuristic for the Maximum Clique Problem

Hyperledger Besu Kubernetes Deployment

Universal Cast-as-Intended verifiable e-voting on a permissioned blockchain

Ethereum Private Network with Docker

This repository contains the code for the lab session of the course Graph Theory.

This project together with mrcp document explain process of develop and analitic of MRCP or Maximum Ratio Clique Problem. Wich starting from a graph with nodes and different weights of these, the algorithm will find an aproximate optimal solution, forming a clique or a complete sub-graph with maximum ratio.

JFlap automata and slides about the clique problem.

#ethereum #geth #clique #poa #protocol

A simple but slow genetic algorithm for undirected graphs based on feasibility maintenance.

Decomposition by clique separators and some exercises for two courses on statistical models given by prof. Giovanni Marchetti @ University of Florence

Implementation of DDA algorithm for finding maximal degree-based quasi-cliques using Gonum graph representation.