Wiring Diagram Processing
-
Updated
May 24, 2024 - Python
Wiring Diagram Processing
C++/Wolfram Language package for exploring set and graph rewriting systems
[SIGIR 2024] NFARec: A Negative Feedback-Aware Recommender Model.
Python package for hypergraph analysis and visualization.
Standardized higher-order datasets with corresponding datasheets
[ECCV 2024]Temporary code for "Ad-HGformer: An Adaptive HyperGraph Transformer for Skeletal Action Recognition"
KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
Utilities for cospans, wiring diagrams, frobenius algebras , spans, en operads and petri nets along with more basic utilities for morphisms in (symmetric) monoidal categories, flavors of FinSet, operads and nicely presented monoids
Official implementation of TACCO (Task-guided Co-clustering).
Knowledge Graph Toolkit
Multidimensional Mind Mapping
Python binding for Reticula: the general purpose library for analysing static, temporal and hypergraph networks.
A Python module for directed hypergraphs
single-cell Hi-C, scHi-C, Hi-C, 3D genome, nuclear organization, hypergraph
parag🎆Interactive visualization of higher-order graphs in Python
Add a description, image, and links to the hypergraph topic page so that developers can more easily learn about it.
To associate your repository with the hypergraph topic, visit your repo's landing page and select "manage topics."