Abstract: Maximal clique enumeration (MCE) is a classic problem in graph theory to identify all complete subgraphs in a graph. In prior MCE work, the Bron-Kerbosch algorithm is one of the most popular ...

100% pure JavaScript Headless support domain-model Highly tested Customizable data-model Zero-dependencies - although Konva.js is used a a rendering backed, it is an optional dependency which can be ...