Bachelor/Master Thesis (Leipzig): Parallel sampling and layouting of large graphs
One of the main task of the BIGGR project is to reduce the complexity of the structure of graph for an interactive and efficient visualization. This reduction should be in such a way that the main properties of the graph are preserved. The visualization of the graph even after a proper reduction is a time-consuming algorithm. The interactivity of the software would add to this complexity even more. Different approaches toward this problem can be studied. We search for a student which can help us in this project. The student should have the motivation of learning different topics and bringing them together. The knowledge of Java and Web programming would be helpful.