@inproceedings{Akitaya2018RecognizingWE,
title={Recognizing Weak Embeddings of Graphs},
author={Hugo A. Akitaya and Radoslav Fulek and Csaba D. T{\'o}th},
booktitle={SODA},
year={2018}
}

We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding φ : G→M of a graph G into a 2-manifold M maps the vertices in V (G) to distinct points and the edges in E(G) to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to a common node or arc, due to data compression or low resolution. This raises the… CONTINUE READING