Recognizing Weak Embeddings of Graphs

  title={Recognizing Weak Embeddings of Graphs},
  author={Hugo A. Akitaya and Radoslav Fulek and Csaba D. T{\'o}th},
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
Related Discussions
This paper has been referenced on Twitter 6 times. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 27 references

On-Line Planarity Testing

SIAM J. Comput. • 1996
View 6 Excerpts
Highly Influenced

Detecting Weakly Simple Polygons

View 5 Excerpts
Highly Influenced

Hanani-Tutte for Approximating Maps of Graphs

Symposium on Computational Geometry • 2018
View 8 Excerpts

Embeddability in R 3 is NP - hard

Arnaud de Mesmay, Yoav Rieck, Martin Tancer.
Preprint • 2017

Graph theory, volume

Reinhard Diestel
Graduate Texts in Mathematics. Springer, Heidelberg, fifth edition, • 2017
View 1 Excerpt

Hanani–Tutte for approximating maps

Radoslav Fulek, Jan Kynčl
of graphs. Preprint, • 2017

Similar Papers

Loading similar papers…