New YIN grant in algorithmics
With a project on efficient and scalable partitioning of large graphs and networks with application, for example, in numeric simulation, YIN supports a collaboration of computer scientists Juniorprofessor Henning Meyerhenke and Dr. Martin Nöllenburg (YIG). The goal of the project is, in a first step, to draw the graph into the plane using force-based layout algorithms, so that geometric and graph-theoretic proximity of nodes relate well to each other. In a second step, fast geometric partitioning algorithms can be used to partition the graph. This combined approach promises better scalability to very large graphs while still yielding high quality partitions.