Visualization of graphs and networks has become crucial in many real world applications, especially nowadays when large scale networks need to be displayed in an easy-to-grasp way. Deep theoretical results in structural graph theory lead to design of fast algorithms to achieve this, while, at the same time, motivation stemming from applications strongly influences basic research in graph theory and discrete mathematics.
The aims of the CRP are to attack well known hard problems both from structural and algorithmic points of view. The research will be concentrated around planarity issues, will go beyond planarity and explore geometric representations of graphs.
Given the dynamics of the field we expect to encounter and identify new frontiers and new research directions. A key ingredient of the project is cross-fertilization of theory and applications.
All teams include experienced researchers that have been working in the area of Graph Drawing for years, and the graph on left shows previous collaboration among the teams. The European added value of the project is coordination of research of the main European players in the field. Fostering collaboration across the teams will lead to creating a critical mass needed to successfully attack difficult problems. The CRP will enable upgrading the existing bilateral collaboration to a true multilateral one by fostering joint research, organizing regular workshops and seminars and supporting frequent research visits. In terms of graph drawing, one of the goals of this CRP is to turn the collaboration graph into a dense hypergraph.