09/09/2019
14:00 - 15:00

 

Representations of Correlated Probabilistic Databases
Nils Freyer
As an extension of Codd's relational data model, probabilistic databases were discussed in the literature when the relational data model became popular in the 1980's. The studies of probabilistic databases were motivated by errors in the data collection process and designed as a generalisation of the relational data model that is able to integrate probabilistic data into relational data. Today, the amount of data and information is growing strictly, which causes a lot of research in information extraction and efforts in representing the extracted information. One can imagine that representing correlated probabilistic data is not trivial. We will present the most common representation systems for probabilistic data and examine their properties. Afterwards, we will construct translations between the representation systems to draw conclusions on their relationships.

28/06/2019
10:00 - 11:00

 

21/06/2019
10:00 - 11:00

 

14/06/2019
10:00 - 11:00

 

31/05/2019
10:00 - 11:00

 

31/05/2019
10:00 - 11:00

 

24/05/2019
10:00 - 11:00

 

23/05/2019
13:00 - 14:00

 

The Weisfeiler-Leman Dimension of Graphs of Bounded Treedepth
Luca Oeljeklaus
In this talk we discuss the dimension of the Weisfeiler-Leman (WL) algorithm, which is a combinatorial algorithm used as a subroutine for graph isomorphism testing, in terms of treedepth, a graph invariant also referred to as minimum elimination tree height or vertex ranking number. More precisely, we prove upper and lower bounds on the WL-dimension of graphs of bounded treedepth by using two results from Cai, Fürer, and Immerman. In our proof to show that every graph of treedepth at most k is identified by the (k-1)-dimensional WL-algorithm, we use the fact that the (k-1)-dimensional WL-algorithm identifying a graph is equivalent to Spoiler having a winning strategy for the C_k-pebble game between a graph of treedepth at most k and any other non-isomorphic graph. From there we develop an inductive winning strategy for Spoiler over the treedepth of the graph. In our proof to show that there exists a family of pairs of graphs of treedepth k for arbitrarily large k such that the (k/25)-dimensional WL-algorithm does not distinguish them, we apply the CFI-graph construction to a family of graphs with large separators and then prove an upper bound on the treedepth of the resulting pairs of graphs.

25/04/2019
10:30 - 11:30

 

Anytime Approximation in Probabilistic Databases via Scaled Dissociations
Floris Geerts
Speeding up probabilistic inference remains a key challenge in probabilistic databases (PDBs) and the related area of statistical relational learning (SRL). Since computing probabilities for query answers is #P-hard, even for fairly simple conjunctive queries, both the PDB and SRL communities have proposed a number of approximation techniques over the years. The two prevalent techniques are either (i) MCMC-style sampling or (ii) branch-and-bound (B&B) algorithms that iteratively improve model-based bounds using a combination of variable substitution and elimination. In this talk, I present a new anytime B&B approximation scheme that encompasses all prior model-based approximation schemes proposed in the PDB and SRL literature. The approach relies on the idea of “scaled dissociations” which can improve both the upper and lower bounds of existing model-based algorithms. Here, in each iteration, a gradient-descent based optimization method finds the best scaled dissociation bounds after which Shannon expansion is performed. When applied to the well-studied problem of evaluating self-join-free conjunctive queries over tuple-independent PDBs, a consistent reduction in approximation error is experimentally observed. This is joint work with Wolfgang Gatterbauer, Peter Ivanov, Martin Theobald and Maarten Van den Heuvel and will be presented at the SIGMOD 2019 Conference.

17/04/2019
11:00 - 11:45

BSc

Interactive Proof Systems for Counting Subgraphs
Markus Baumann
We provide an introduction to interactive proof systems, which describe two-party games between computational agents. Double efficiency denotes the practice of limiting both parties to efficient computation. We present in detail the recently published, doubly-efficient interactive clique counting protocol of Oded Goldreich and Guy N. Rothblum. Contrary to previous proof systems, that use the sum-check protocol, this one keeps the intuition of counting cliques intact, as it works by iteratively transforming them into smaller clique counting problems. Their work helps us see the applicability of interactive proof systems to tractable problems, and the advantages of double efficiency.

29/03/2019
10:30 - 11:30

BSc

Space Complexity of Regular Languages in the Sliding Window Data Stream Model
Philipp Selz

22/02/2019
10:00 - 11:00

ATI

On the Weisfeiler-Leman Dimension of Graphs of Bounded Genus
Sandra Kiefer
The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension can also be characterised in terms of the number of variables that is required to describe the graph up to isomorphism in first-order logic with counting quantifiers.
It is known that the WL dimension is upper-bounded for all graphs that exclude some fixed graph as a minor. However, the bounds that can be derived from this general result are astronomic. Only recently, it was proved that the WL dimension of planar graphs is at most 3. In this talk, I present some of the techniques from our recent proof that the WL dimension of graphs embeddable in a surface of Euler genus g is at most 4g + 3. This is joint work with Martin Grohe.

08/02/2019
10:00 - 11:00

ATI

The WL-dimension of graphs of bounded rank width
Daniel Neuen
We prove that the combinatorial Weisfeiler-Leman algorithm of dimension (3k+4) is a complete isomorphism test for the class of all graphs of rank width at most k. Rank width is a graph invariant that, similarly to tree width, measures the width of a certain style of hierarchical decomposition of graphs; it is equivalent to clique width. It was known that isomorphism of graphs of rank width k is decidable in polynomial time (Grohe and Schweitzer, FOCS 2015), but the best previously known algorithm has a running time n^{f(k)} for a non-elementary function f. Our result yields an isomorphism test for graphs of rank width k running in time n^{O(k)}. Another consequence of our result is the first polynomial time canonisation algorithm for graphs of bounded rank width. If time permits I will also speak about our second result that fixed-point logic with counting captures PTIME on the class of graphs of rank width at most k.

24/01/2019
10:00 - 10:30

BSc

A neural algorithm for similarity search
Christian Blumenthal

24/01/2019
11:00 - 11:45

MSc

State Space Reduction For Parity Automata
Andreas Tollkötter

18/01/2019
10:00 - 11:00

ATI

14/12/2018
10:00 - 11:00

ATI

Color Refinement and Graph Neural Networks
Martin Ritzert
In this talk we show that the expressive power of the 1-dimensional Weisfeiler Leman algorithm (color refinement) is exactly as powerful as the emerging graph neural networks. Joint work with Martin Grohe and Gaurav Rattan

12/12/2018
11:00 - 11:45

BSc

Spektrale Graphähnlichkeit und Dominanz
Athena Riazsadri
Im Rahmen dieser Arbeit werden die Probleme der spektralen Graphdominanz (GD) und des spektralen Graphähnlichkeit (SGS) vorgestellt. Anstatt etwa die Anzahl der nicht gematchten Kanten zu vergleichen, werden Graphen aufgrund ihrer Eigenwerte und Laplacematrizen verglichen. Damit bietet die hier vorgestellte Lösung im Gegensatz zu anderen Lösungsansätzen zum Graphähnlichkeitsproblem die Möglichkeit, Graphen aufgrund ihrer Funktionalität zu vergleichen, was wiederum Anwendung gerade in der Biologie (Proteinnetzwerke) finden könnte. Die Hauptergebnisse dieser Arbeit sind ein NP-Schwere-Beweis für GD und ein κ^4-Approximationsalgorithmus für SGS auf zwei Graphen beschränkten Grades. Dieser Algorithmus läuft in polynomieller Zeit für ein konstantes κ.

07/12/2018
10:00 - 11:00

ATI

30/11/2018
10:00 - 11:00

ATI

Universal graphs for parity and mean-payoff games
Nathanaël Fijalkow
I will present a new tool for understanding games on graphs called universal graphs. They can be used to construct algorithms for solving games such as parity games and mean-payoff games. The goals of this talk are to: * introduce the notion of universal graphs and their applications to games * give a simple and unified presentation of all three quasipolynomial time algorithms for parity games * construct new algorithms for mean-payoff games * show tight lower bounds for the construction of algorithms in this framework for both parity and mean-payoff games

30/11/2018
10:00 - 11:00

ATI

Universal graphs for parity and mean-payoff games
Nathanaël Fijalkow
I will present a new tool for understanding games on graphs called universal graphs. They can be used to construct algorithms for solving games such as parity games and mean-payoff games. The goals of this talk are to: * introduce the notion of universal graphs and their applications to games * give a simple and unified presentation of all three quasipolynomial time algorithms for parity games * construct new algorithms for mean-payoff games * show tight lower bounds for the construction of algorithms in this framework for both parity and mean-payoff games

23/11/2018
10:30 - 11:30

ATI

Detecting small subgraphs using the exterior algebra
Holger Dell
Color-coding is a popular technique to detect and to approximately count short paths and other subgraphs of bounded treewidth. In this talk, we will discuss Extensor-coding, a natural approach to such subgraph detection problems that turns out to generalize and in some cases improve upon the running time achieved by Color-coding. Based on joint work with Cornelius Brand and Thore Husfeldt.

16/11/2018
10:00 - 11:00

ATI

10/11/2018
00:00 - 03:00

 

Wissenschaftsnacht der Professoren mit DJ Prof. Grohe
DJ Prof. Grohe

09/11/2018
10:30 - 11:30

ATI

A unifying method for the design of algorithms canonizing combinatorial objects
Daniel Wiebking
We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation groups, tree decompositions, and so on. Our approach allows for a systematic transfer of the techniques that have been developed for isomorphism testing to canonization. We use it to design a canonization algorithm for general combinatorial objects. This result gives new fastest canonization algorithms with an asymptotic running time matching the best known isomorphism algorithm for the following types of objects: hypergraphs, hypergraphs of bounded color class size, permutation groups (up to permutational isomorphism) and codes that are explicitly given (up to code equivalence).

26/10/2018
14:15 - 15:15

 

Explaining and Representing Novel Concepts With Minimal Supervision
Zeynep Akata (University of Amsterdam)
Clearly explaining a rationale for a classification decision to an end-user can be as important as the decision itself. Existing approaches for deep visual recognition are generally opaque and do not output any justification text; contemporary vision-language models can describe image content but fail to take into account class-discriminative image properties which justify visual predictions. In this talk, I will present my past and current work on Zero-Shot Learning, Vision and Language for Generative Modeling and Explainable Artificial Intelligence where we show (1) how to generalize image classification models to cases when no visual training data is available, (2) how to generate images and image features using detailed visual descriptions, and (3) how our models focus on discriminating properties of the visible object, jointly predict a class label, explain why/not the predicted label is chosen for the image.

23/10/2018
16:15 - 17:00

 

Polyregular functions
Mikołaj Bojańczyk
I will describe a class of string-to-string transducers, which goes beyond rational or regular functions, but still shares many of their good properties (e.g. the inverse image of a regular language is regular). Unlike many string-to-string transducer models (including sequential, rational and regular transducers), which have linear size increase, the the new class (called polyregular functions) has polynomial size increase. The main selling point of the polyregular functions is that they admit numerous equivalent descriptions:  automata with pebbles; (b) a fragment of lambda calculus; (c) a fragment of for-programs; and (d) compositions of certain atomic functions, such as reverse or a form of string squaring. Also, most likely (this is still ongoing work): (e) mso string-to-string interpretations.

10/10/2018
10:00 - 10:45

MSc

Spectral graph similarity
Timo Gervens

05/10/2018
11:00 - 11:45

BSc

Weighted Symmetric Model Counting for Two Variable Logic
Tobias Schleifstein
The first order model counting problem (FOMC) asks for the number of models of a FO-sentence with the domain of given size n. The weighted first order model counting problem (WFOMC) additionally assigns a weight to every tupel of the models' relations. In the symmetric variant, which is mainly studied in this thesis, we have to assign the same weights to all tupels of the same relation. We review the results for tractability of the symmetric WFOMC for two-variable logic and three-variable logic. In particular we discuss the data complexity, i.e., the complexity of computing the problems with only the size n of the domain as an input and the formula and weights fixed. It has been shown that the WFOMC is computable in polynomial time for FO² and an extension, but #P_1-complete for FO³.

28/09/2018
10:15 - 11:00

BSc

Algorithms for the Maximum Common Subtree Isomorphism Problem
Florian Frantzen
The maximum common subtree isomorphism problem asks for the largest possible isomorphism among all common subtree isomorphisms between two unrooted input trees. This can either be formulated in terms of the size of the common subtree, or more generally with respect to a weight function. Its more general formulation of a maximum common subgraph isomorphism problem, which permits arbitrary input graphs instead of only trees, is known to be NP-complete. The restricted setting allows for efficient polynomial time algorithms. We present a particular recent algorithm due to Droschinsky, Kriege and Mutzel for this problem. For unrooted trees of order n and degree Delta, this algorithm achieves a worst-case running time of O(n^2 Delta). We complement this theoretical description of the algorithm with various tests of possible changes to the algorithm and compare their impacts on our own implementation of the algorithm. We also compare our implementation to other programs that can be used to compute a solution for the maximum common subtree isomorphism problem.

28/09/2018
11:00 - 11:45

BSc

The quantifier depth for distinguishing structures in first-order logic
Bianka Bakullari
The Weisfeiler-Leman algorithm is a combinatorial procedure used to distinguish non-isomorphic graphs. I give an introduction to the mechanisms of the algorithm by putting the focus on the 2-dimensional variant of it, for which I explain the non-trivial upper bound O(n^2/log n) on the number of iterations. Then graphs are defined as relational structures to show the connection between the dimension of the algorithm and the number of variables used in logics with counting. In the end, we show an approach to represent arbitrary finite relational structures as colored graphs in a way that we can apply the Weisfeiler-Leman algorithm to distinguish them. We use the connection between the algorithm and logics with counting to make claims about the quantifier depth of the formulas that distinguish non-isomorphic finite relational structures.

28/09/2018
11:45 - 12:30

BSc

Parameterized Approximability of Dominating Set
Daniel Schleiz
Due to the NP-hardness of the Dominating Set decision problem, there is no efficient algorithm solving it unless P=NP. Seperate approximation and parameterization approaches to make this problem more tractable have shown to yield dissatisfactory results. Thus the parameterized approximability of Dominating Set has been an open question for a while, where for a Graph G with n vertices and an integer k given as input, an algorithm computing a dominating set of size at most H(k)*k with a runtime of F(k)*poly(n) for some computable functions H,F is of interest. Only recently Karthik, Laekhanukit and Manurangsi (2018) were able to rule out such an algorithm under the assumption of W[1]!=FPT. In this bachelor thesis talk, the proof for this result will be presented along with the needed background on parameterized complexity. Furthermore, a stronger runtime lower bound of F(k)*n^{o(k)} up to the same approximation ratio assuming the Exponential Time Hypothesis will be shown, resulting from the same work of Karthik et al.

28/09/2018
12:30 - 13:15

BSc

Optimization-based Hierarchical Clustering
Michael Scholkemper
Hierarchical clustering is a data analysis method that recursively partitions a given data set into increasingly smaller clusters. The structure that is obtained from this procedure is then represented by a tree - or a dendogram. This thesis presents the work by [Dasgupta, 2016] and the subsequent work by [Cohen-Addad et al., 2018] that spawned the theoretical study of the problem. Therein an optimization framework for Hierarchical Clustering is established by defining an objective function, thus framing it as a combinatorial optimization problem. This thesis presents the needed theory for the proposed optimization framework and provides approximation algorithms for both similarity and dissimilarity inputs as. Additionally, a family of inputs constrained in such a way as to admit efficient Hierarchical Clustering is presented.

27/09/2018
14:00 - 14:45

MSc

Optimization for the complementation of Büchi automata
Lasse Nitz

26/09/2018
11:00 - 12:00

MSc

Real-valued Connectivity Systems
Eva Fluck
Based on a survey on connectivity, decompositions and tangles by Grohe [5], we adapt the so far integer-valued theory onto real-valued set functions. We start by adapting the definition of finite connectivity systems including the def- inition of connectivity functions and give examples of different functions and uni- verses. A connectivity function is a set function κ : 2 U → R on a finite universe U , which is symmetric, normalized and submodular, that is, for all X, Y ∈ U , κ(X)+κ(Y ) ≥ κ(X ∩Y )+κ(X ∪Y ). We find that the codomain of κ is discrete. This allows us, similar to integer-values, to do inductive arguments using a value called granularity, which is the smallest non-zero difference between two function values. Then we look at the definitions of tangles, which we view as highly connected regions of the universe, and branch decompositions, which are tree like decompositions of the universe related to the well-known tree decompositions, into this new setting. We are able to prove that both definitions behave similar to integer-valued systems. Next we derive the duality theory between branch decompositions and tangles, first developed by Robertson and Seymour [11]. This duality states, that we can construct a branch decomposition of a certain width k if there is no tangle of order k and that a branch decomposition of width k is a witness for the non-existence of a tangle of order k. So far this duality was mostly based on the submodularity of the set function. We find additional functions, where branch decomposition is also dual to tangles. We find a property of the set function that we call submodular bounded, that is, for all sets X, Y ∈ U and all k ∈ R, if κ(X), κ(Y ) ≤ k then κ(X ∩ Y ), κ(X ∪ Y ) ≤ k. Submodular bounded leads to an equivalent duality theory as submodularity. Lastly, we show that there is a way to canonically decompose real-valued connectivity systems into their maximal tangles.

26/09/2018
12:00 - 12:45

BSc

Distance-Aware Colour Refinement
Björn Plewinski
Color refinement is a graph algorithm used in isomorphism testing which also shows great promise in designing graph kernels for machine learning applications. This bachelor thesis explores an extension of this algorithm which incorporates distances between vertices. We will examine the algorithms theoretical properties and compare it and its performance with the standard color refinement algorithm and the two-dimensional Weisfeiler-Leman algorithm.

25/09/2018
10:00 - 10:30

BSc

Nondeterministic automata with deterministic acceptance strategies
Domenic Quirl

25/09/2018
10:45 - 11:15

BSc

Canonical automata for regular languages
Magnus Groß

14/09/2018
11:00 - 12:00

MSc

Structural Similarity and Homomorphism Counts
Jan Böker
Recent results show how the structural similarity of graphs can be characterized by counting homomorphisms to them. We show how homomorphism counts characterize the structural similarity of related relational structures, with a focus on directed graphs, (vertex-)colored graphs, and multi-hypergraphs. We prove that two directed graphs G and H are isomorphic if and only if, for every directed acyclic graph D, the number of homomorphisms Hom(D,G) from D to G is equal to the corresponding number Hom(D,H) from D to H. Our approach also yields a similar statement for undirected graphs, where it suffices to count homomorphisms from three-colorable graphs. We show how, after encoding a colored graph as an uncolored one, counts of homomorphisms to these graphs can be obtained from each other. This allows us to generalize a recent result on uncolored graphs, obtaining that two colored graphs G and H are not distinguished by the color-refinement algorithm if and only if, for every colored tree T, we have Hom(T, G) = Hom(T, H). Additionally, this reduction also works for a generalization of said result to bounded treewidth. We introduce a generalization of the color-refinement algorithm for multi-hypergraphs and prove that it does not distinguish two multi-hypergraphs G and H if and only if, for every Berge-acyclic multi-hypergraph B, we have Hom(B, G) = Hom(B, H). To this end, we show how homomorphisms of multi-hypergraphs and their colored incidence graphs are related to each other.

14/09/2018
12:00 - 12:45

BSc

End-to-End Graph Learning
Emre Yamen
In der Präsentation wird End-to-End Graph Learning definiert, was eine Möglichkeit der Graphen Klassifizierung ist. Zudem wird erklärt wie man Graphen kanonisieren kann. Danach wird eine aktuelle Methode zur Graphen Klassifizierung präsentiert, die Graph Kernel. Da wird mehr auf die Weisfeiler-Leman subtree kernel eingegangen. Danach werden Experimente zur Graphen Klassifizerung mit End-to-End Graph Learning und Graph Kanonisierung in einem neuronalen Netzwerk vorgestellt. Das Ergebnis wird mit dem Ergebnis vom Weisfeiler-Leman subtree kernel in Neuronalen Netzwerken verglichen.

05/09/2018
09:30 - 10:30

BSc

Similarity of Small Graphs
Stefanie Winkler
The graph similarity problem deals with the computation of the distance between two given graphs and is therefore closely related to graph isomorphism. There are different approaches to define this distance. This thesis mainly deals with the Frobenius distance. Besides proving the NP-completeness of the problem, we examine its behavior on small graphs. To achieve this, we implement it as a mathematical optimization model in Java using the tool CPLEX. We use the implementation to compute the distance of all graphs up to size five and for some selected bigger graphs. To summarize the results, we present them in multiple plots showing the occurring distances and the runtime. Since the problem is NP-hard, it is not efficient to solve unless P = NP. Therefore, we approximate the exact calculation by convex relaxation. We examine the resulting measure as done for the unrelaxed case. Furthermore, we directly compare the computed distances on pairs of graphs to analyze the ratio between the two. Other approaches to graph similarity include the minimum graph edit distance and the maximum common subgraph. We present their respective definition and prove their NP-hardness.

29/08/2018
10:00 - 11:00

BSc

Graph Autoencoder
Florian Behrens

29/08/2018
10:00 - 11:00

BSc

Graph Autoencoder
Florian Behrens

24/08/2018
10:00 - 10:30

 

Climbing up the elementary complexity classes with theories of automatic structures
Peter Lindner
Automatic structures are of particular interest, since their first order theories are decidable. While these theories might be of non-elementary complexity in general, the practically relevant examples are located below 3-fold exponential time (e. g. Presburger arithmetic and automatic structures of bounded degree). It was an open question [Durand-Gasselin], whether there are automatic structures with theories of higher elementary complexity. In my masters thesis, I introduced a family of automatic structures, roughly covering all of the complexity classes k-EXPTIME for k > 2. Presented in this talk is now the joint work with Faried Abu Zaid and Dietrich Kuske (TU Ilmenau), who were able to close the remaining gaps and thus give an exact characterization of the complexity of the mentioned structures. The presented proofs contain various involved encoding techniques.

16/08/2018
15:00 - 16:00

MSc

Titel: Colour Refinement and Fractional Isomorphism on Weighted Structures
Hinrikus Wolf
Colour refinement is a basic algorithm for graph isomorphism testing. It splits the vertex set of a graph until all vertices in a class have the same number of neighbours in every other class. The resulting partition is called (coarsest) equitable partitionof a graph. Tinhofer, Ramana et al. and Godsil found a tight connection between equitable partitions of a graph and fractional automorphisms, which are the LP relaxation of the natural ILP formulation of graph isomorphism. Grohe et al. generalised the colour refinement algorithm for weighted bipartite graphs in a matrix representation and they introduced a theory of equitable partitions, fractional automorphisms and fractional isomorphisms for weighted bipartite graphs in a matrix representation. We develop a series of generalisations and extensions of their theory. Firstly, we modify the colour refinement algorithm to work on weighted directed graphs in matrix representation. Furthermore, we extend the theory of equitable partitions, fractional automorphisms and fractional isomorphisms to weighted directed graphs. Secondly, we adapt the results for graphs with an additional weighted unary or binary relation. Then we adapt Atserias’ and Maneva’s definition of k-equitable partitions to state the k-dimensional colour refinement algorithm for weighted directed graphs. Thirdly, we generalise k-equitable partitions and k-dimensional colour refinement to weighted τ-structures. In the end, we state a general theorem on the consistent theory of equitable partitions, fractional automorphisms and fractional isomorphisms.

15/06/2018
10:15 - 11:15

 

A unified approach to Büchi determinisation
Anton Pirogov
Nondeterministic Büchi automata are one of the simplest types of finite automata on infinite words and are successfully applied in model checking. In some settings nondeterminism is not feasible in practice, but determinisation of Büchi automata is a difficult problem with a long history and a few different solutions. In our work we noticed similarities in two different determinisation constructions and studied those to obtain a generalized algorithm from which both original constructions can be recovered as special cases. In this talk I will sketch both constructions, illuminate their relationship and give an idea of the unified procedure. (Joint work with Christof Löding)

25/05/2018
10:15 - 11:15

 

Obstacles for better algorithms for the Graph Isomorphism Problem
Daniel Neuen
I will mainly talk about a new algorithm solving the isomorphism problem for graphs of maximum degree d in time n^{polylog(d)} where n denotes the number of vertices of the input graphs. The previous best algorithm for this problem due to Luks runs in time n^{O(d)}. This result also improves on the recent quasipolynomial time algorithm for the general graph isomorphism problem due to Babai and in particular results in a faster algorithm for graphs of logarithmic degree, one of the bottleneck cases in Babai's algorithm. If time permits I will also discuss further bottleneck cases for Babai's algorithm and present some open questions regarding these cases.

18/05/2018
10:15 - 11:15

 

Tree Automata with Global Constraints
Patrick Landwehr
We study an extension of standard tree automata that allows for testing (dis)equality of subtrees, which may be arbitrary far away from each other. We introduce a general model, look at known results on finite trees and discuss where these results can be extended to infinite trees. In particular, we briefly tackle closure properties and then analyze the decidability of the universality- and emptiness-problem.

04/05/2018
10:15 - 11:15

 

Lovasz meets Weisfeiler and Leman
Martin Grohe
I will speak about an unexpected correspondence between a beautiful theory, due to Lovasz, about homomorphisms and graph limits and a popular heuristic for the graph isomorphism problem known as the Weisfeiler-Leman algorithm. I will also relate this to graph kernels in machine learning. Indeed, the context of this work is to desgin and understand similarity measures between graphs and discrete structures. (Joint work with Holger Dell and Gaurav Rattan.)

04/05/2018
10:15 - 11:15

 

Lovasz meets Weisfeiler and Leman
Martin Grohe
I will speak about an unexpected correspondence between a beautiful theory, due to Lovasz, about homomorphisms and graph limits and a popular heuristic for the graph isomorphism problem known as the Weisfeiler-Leman algorithm. I will also relate this to graph kernels in machine learning. Indeed, the context of this work is to desgin and understand similarity measures between graphs and discrete structures. (Joint work with Holger Dell and Gaurav Rattan.)