Problems in large graphs (e.g., social networks, VANETs)
A number of interesting problems nowadays can be modelled by large graphs. For example, web links constitute a graph (google and the pagerank algorithm exploit properties of this graph), also facebook friendships, paper citation patterns and many more. In more technical settings, similar graphs could be used to model patterns of communication for moving vehicles setting ad hoc networks on the road (known as VANETS). In all these situations, there are several issues related to the extraction of knowledge that could be used to understand and provide good services related to the above scenarios. I am happy to discuss and shape a project in this area.
The School has full scholarship opportunities for home and EU students. For international students, the School has fees contribution awards. These awards are awarded on a competitive basis.
Further information on funding can be found here: http://www.cs.manchester.ac.uk/study/postgraduate-research/programmes/phd/funding/
The minimum requirements to get a place in our PhD programme are available from:
How good is research at University of Manchester in Computer Science and Informatics?
FTE Category A staff submitted: 44.86
Research output data provided by the Research Excellence Framework (REF)
Click here to see the results for all UK universities