Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler curves of moving graphs and counting realizations of rigid graphs".This project received funding from Austrian Science Fund (FWF): P33003 German Research Foundation (DFG): EL1092/1-1 Austrian Science Fund (FWF): P3188
The Weisfeiler-Leman (WL) algorithm is a fundamental combinatorial technique used to classify graphs...
One of the most famous algorithmic meta-theorems states that every graph property that can be define...
The main result of this thesis is the proof of the "w-cycle conjecture". This was done in collaborat...
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler ...
These files contain implementations of the main algorithm of Capco, Gallet, Grasegger, Koutschan, L...
This piece of python code provides functionality for computing the number of complex realizations of...
This is a SageMath package for studying flexible and rigid labelings of graphs. It implements the c...
This data set consists of files for all Laman graphs (minimally rigid graphs) with at most 12 vertic...
We present the mathematical basics of minimally rigid graphs in two and three dimensions. Using this...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
AbstractWe introduce the idea of Assur graphs, a concept originally developed and exclusively employ...
In this paper we describe by pseudo-code the ``Algorithm of the cyclic-order graph'', which we progr...
These are the course notes for half of the MPRI course “Algorithms and combinatorics for geometric g...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
One of the most famous algorithmic meta-theorems states that every graph property that can be define...
The Weisfeiler-Leman (WL) algorithm is a fundamental combinatorial technique used to classify graphs...
One of the most famous algorithmic meta-theorems states that every graph property that can be define...
The main result of this thesis is the proof of the "w-cycle conjecture". This was done in collaborat...
Calligraphs.wl is a mathematica package implementing the algorithms described in the paper "Coupler ...
These files contain implementations of the main algorithm of Capco, Gallet, Grasegger, Koutschan, L...
This piece of python code provides functionality for computing the number of complex realizations of...
This is a SageMath package for studying flexible and rigid labelings of graphs. It implements the c...
This data set consists of files for all Laman graphs (minimally rigid graphs) with at most 12 vertic...
We present the mathematical basics of minimally rigid graphs in two and three dimensions. Using this...
We illustrate the use of formal languages and relations in compact formal derivations of some graph ...
AbstractWe introduce the idea of Assur graphs, a concept originally developed and exclusively employ...
In this paper we describe by pseudo-code the ``Algorithm of the cyclic-order graph'', which we progr...
These are the course notes for half of the MPRI course “Algorithms and combinatorics for geometric g...
AbstractTensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and ...
One of the most famous algorithmic meta-theorems states that every graph property that can be define...
The Weisfeiler-Leman (WL) algorithm is a fundamental combinatorial technique used to classify graphs...
One of the most famous algorithmic meta-theorems states that every graph property that can be define...
The main result of this thesis is the proof of the "w-cycle conjecture". This was done in collaborat...
DOI
Add to ORKG