View Proposal

---

Proposer

Hans Wolfgang Loidl

Title

High-performance graph algorithms for social networks

Goal

Develop a compact graph application

Description

Relationships in social networks such as Facebook are typically captured as graphs with users as nodes and relationships as edges. Such graphs become huge when used in the context of social networks. Learning non-trivial relationships and trends in such networks is very time consuming and therefore needs efficient algorithms. In this project, application kernels should be developed for parallel graph algorithms on large graph structures, in order to learn new relationships. The core activity will be to implement parallel versions of the graph traversal algorithms and to assess performance. These application kernels should be implemented in an object-oriented language (eg. Java or C#) and in a functional language (eg. Haskell or ML). The performance of both implementations should be evaluated on a range of large input graphs.

Resources

Powerful compute server (as in the department)

Background

Working knowledge in object-oriented and some background in func

Url

External Link

Difficulty Level

Moderate

Ethical Approval

None

Number Of Students

2

Supervisor

Hans Wolfgang Loidl

Keywords

Degrees

Bachelor of Science in Computer Science
Bachelor of Science in Computer Systems
Master of Engineering in Software Engineering
Master of Science in Artificial Intelligence
Master of Science in Computing (2 Years)
Master of Science in Information Technology (Software Systems)
Bachelor of Engineering in Robotics