Algorithmic graph embeddings

Jianer Chen
1997 Theoretical Computer Science  
The complexity of embedding a graph into a variety of topological surfaces is investigated. A new data structure for graph embeddings is introduced and shown to be superior to the previously known data structures. In particular, the new data structure efficiently supports all on-line operations for general graph embeddings. Based on this new data structure, very efficient algorithms are developed to solve the problem "given a graph G and an integer k, construct a genus k embedding for the graph
more » ... G" for a large range of integers k and for a large class of graphs G. *
doi:10.1016/s0304-3975(96)00273-3 fatcat:xi342d6vffgifar277c4wv3534