Mathias Jansen

Learn More
Deciding c-planarity for a given clustered graph C = (G, T) is one of the most challenging problems in current graph drawing research. Though it is yet unknown if this problem is solvable in polynomial time, latest research focused on algorithmic approaches for special classes of clustered graphs. In this paper, we introduce an approach to solve the general(More)
This work deals with an algorithmic problem called Maximum c-planar subgraph problem (MCPSP) that can be sorted into the research area Graph Drawing. Graph Drawing considers the development of efficient algorithms for determining " good " drawings and layouts of graphs in the plane with the purpose of giving an appropriate visualization of the information(More)
  • 1