Algorithmic Graph Embeddings

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 G” for a large range of the integers k and for a large class of graphs.

[1]  Hristo Djidjev,et al.  An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs , 1991, STOC '91.

[2]  Bojan Mohar,et al.  Projective Planarity in Linear Time , 1993, J. Algorithms.

[3]  Jianer Chen,et al.  A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus , 1994, SIAM J. Discret. Math..

[4]  Carsten Thomassen,et al.  The Graph Genus Problem is NP-Complete , 1989, J. Algorithms.

[5]  Jianer Chen,et al.  Kuratowski-Type Theorems for Average Genus , 1993, J. Comb. Theory, Ser. B.

[6]  Giuseppe F. Italiano,et al.  Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract) , 1993, ESA.

[7]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[8]  Jianer Chen,et al.  Limit points for average genus II. 2-Connected non-simplicial graphs , 1992, J. Comb. Theory, Ser. B.

[9]  Jianer Chen,et al.  A tight lower bound on the maximum genus of a simplicial graph , 1996, Discret. Math..

[10]  Jianer Chen,et al.  On the Complexity of Graph Embeddings (Extended Abstract) , 1993, WADS.

[11]  Jianer Chen,et al.  A Note on Approximating Graph Genus , 1997, Inf. Process. Lett..

[12]  Greg N. Frederickson.  Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems , 1995, J. Algorithms.

[13]  Jonathan L. Gross,et al.  Finding a maximum-genus graph imbedding , 1988, JACM.

[14]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[15]  I. S. Filotti,et al.  An Algorithm for Imbedding Cubic Graphs in the Torus , 1980, J. Comput. Syst. Sci..

[16]  Jonathan L. Gross,et al.  Hierarchy for imbedding-distribution invariants of a graph , 1987, J. Graph Theory.

[17]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[18]  Jianer Chen,et al.  Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs , 1992, J. Comb. Theory, Ser. B.

[19]  Jianer Chen,et al.  Maximum genus and connectivity , 1996, Discret. Math..

[20]  Roberto Tamassia,et al.  A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract) , 1988, ICALP.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .