research
∙
12/08/2021
On anti-stochastic properties of unlabeled graphs
We study vulnerability of a uniformly distributed random graph to an att...
share
research
∙
05/18/2020
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful com...
research
∙
05/18/2020
The Weifeiler-Leman Algorithm and Recognition of Graph Properties
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful com...
research
∙
02/11/2020
Local WL Invariance and Hidden Shades of Regularity
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a powerful tool f...
research
∙
10/24/2019
On the Weisfeiler-Leman Dimension of Fractional Packing
The k-dimensional Weisfeiler-Leman procedure (k-WL), which colors k-tupl...
research
∙
07/05/2019
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
As it is well known, the isomorphism problem for vertex-colored graphs w...
research
∙
11/09/2018
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
We investigate graph properties and parameters that are invariant under ...
research
∙
02/06/2018
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism
Let v(F) denote the number of vertices in a fixed connected pattern grap...
research
∙
03/28/2013
