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)
  • 1