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 1 of 1 for “"Constrained Planarity"”.

  1. 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 …

    passau-thes Repository record for Constrained Planarity Algorithms in Theory and Practice (opens in a new tab)