Advances in Testing C-Planarity of Embedded Flat Clustered Graphs

This research work explores the complexity and special cases of C-planarity testing in embedded flat clustered graphs. It discusses the challenges, known polynomial subcases, and the concept of saturators in the context of flat embedded clustered graphs.

0 views • 21 slides