🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin
-
Updated
May 13, 2025 - Kotlin
🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin
Out-of-GPU-Memory Graph Processing with Minimal Data Transfer
Transforming Graphs for Efficient Irregular Graph Processing on GPUs
A Solver for the Wavelength Assignment Problem (RWA) in WDM networks
Graph based Reaction Template Extraction
Shared, eMoflon-specific component for incremental unidirectional and bidirectional graph transformations
A visual debugger for graph transformation systems
Independent and reusable GUI components for graph transformation rules and Triple Graph Grammars
Tool for building GTS Morphisms and Amalgamations
simple labelled graph rewriting for .NET
Incremental Fast Lightweight (y) virtual network Embedding framework
Experiments of developing an IRTG which simultaneously encodes transformations between phrase structure trees, dependency graphs and semantic graphs.
Graph-Based (M)ILP Problem Specification Tool
A collection of all tests for ibex variants
Examples for the GIPS framework.
Incremental unidirectional and bidirectional graph transformations with the Democles pattern matching engine
CI and build scripts for GIPS framework Eclipse installations.
CI and build scripts for the GIPS framework VM based on Ubuntu.
Research project to use graphs and graph transformation in software engineering
Add a description, image, and links to the graph-transformation topic page so that developers can more easily learn about it.
To associate your repository with the graph-transformation topic, visit your repo's landing page and select "manage topics."