SFB 876/A6 - Resource efficient analysis of graphs

[Members] [Support] [Overview]


  • Prof. Dr. Kristian Kersting
  • Prof. Dr. Petra Mutzel
  • Prof. Dr. Christian Sohler


Research supported by Deutsche Forschungsgemeinschaft, grant NA.


Linked data and networks occur often in the context of embedded systems. Sensors, RFID-chips, cameras, etc. of products of our daily life continuously produce data and communicate with each other as well as the user. A natural representation of linked data are graphs where objects correspond to the vertices of the graph and the links to its edges. In this project, we will develop new approaches and algorithms for the classification of graphs and linked data sets under resource constraints. To this aim, randomized approaches from algorithmic theory, approaches for mining and learning with graphs (in particular graph kernels) and algorithmic engineering approaches will be combined.

Letzte Änderung am 26.07.2017 von A. Krivošija