Thesis topic proposal
Tamás Vinkó
Networks and linear algebra


Institute: University of Szeged
computer sciences
PhD School in Computer Science

Thesis supervisor: Tamás Vinkó
Location of studies (in Hungarian): SZTE
Abbreviation of location of studies: SZTE

Description of the research topic:

Network science and linear algebra are strongly related fields. The adjacency matrix of a graph is one of the definitions establishing this connection. Recently, lots of problems and their algorithmic solutions in network science and graph theory have been translated to the language of linear algebra (see, e.g. [1]). This research topic aims at contributing to this trend. The goal is to propose models and algorithms which provide faster solutions of graph related problems using efficient parallel or distributed computing.

[1] J Kepner and J Gilbert, eds. Graph algorithms in the language of linear algebra, SIAM, 2011.

Recommended language skills (in Hungarian): english
Number of students who can be accepted: 1

Deadline for application: 2017-03-31

2017. I. 31.
ODT ülés
Az ODT következő ülésére 2017. március 10-én 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).

All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 1.2334 ( 2017. I. 15. )