Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Clustered Planarity"”.
-
Constrained Planarity Algorithms in Theory and Practice
In the constrained planarity setting, we ask whether a graph admits a crossing-free drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where vertices have to lie on given horizontal …
-
Minors and planar embeddings of digraphs
… of arcs in the local rotation at each vertex. Clustered planar digraphs have planar embeddings in which, at each vertex, all of the in-arcs occur sequentially in the local rotation. Three different variations of minors are presented, each of which produces a finite set of obstructions to …