| Description |
-
Abstract: An
\emph{embedding} of a graph $G$ is a drawing $\varphi:G\rightarrow M$ of $G$ on a
surface $M$ such that every vertex in $V(G)$ is mapped to a distinct point and edges in
$E(G)$ to interior-disjoint Jordan arcs between the corresponding vertices. A \emph{weak
embedding} is a map $\varphi:G\rightarrow M$ such that, for every $\varepsilon>0$,
there exists an embedding ... read more$\psi_\varepsilon:G\rightarrow M$ so that
$\|\varphi-\psi_\varepsilon\|
Thesis (Ph.D.)--Tufts
University, 2018.
Submitted to the Dept. of Computer
Science.
Advisor: Diane
Souvaine.
Committee: Csaba Tóth, Erik Demaine,
Greg Aloupis, and Lenore Cowen.
Keyword: Computer
science.read less
|
|---|
This object is in collection
