Embedding Planar Graphs in Four Pages

@article{Yannakakis1989EmbeddingPG,
  title={Embedding Planar Graphs in Four Pages},
  author={Mihalis Yannakakis},
  journal={J. Comput. Syst. Sci.},
  year={1989},
  volume={38},
  pages={36-67}
}
A book embedding of a graph consists of an embedding of its nodes along the spine of a book (i.e., a linear ordering of the nodes), and an embedding of its edges on the pages so that edges embedded on the same page do not intersect. The objective is to minimize the number of pages used. The minimum number of pages in which a graph can be embedded is called the pagenumber of the graph. The book embedding problem arises in connection with an approach to faulttolerant VLSI design [R, CLRl, CLR2… CONTINUE READING
80 Citations
12 References
Similar Papers

References

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

An algorithm for embedding planar graphs in six

  • S. ISRAIL
  • pages, manuscript,
  • 1986

ROSENBERG, Embedding graphs in books: A graph layout problem with applications to VLSI design

  • F.R.K. CHUNG, F. T. LEIGHTON, L A.
  • SIAM J Algebraic Discrete Methods
  • 1986

SHOR, On the pagenumber of planar graphs, in “Proceedings

  • P.W.J.F. Buss
  • 16th Annu. ACM Symp. on Theory of Computing
  • 1984

TARJAN , Efficient planarity testing

  • E. CH’UJ.HOPCROFTANDR.
  • J . Assoc . Comput . Mach .
  • 1984

G~LUMBIC, “Algorithmic Graph Theory and Perfect Graphs

  • M C.
  • 1980

HEATH , Embedding planar graphs in seven pages , in “ Proceedings , 25 th Annu

  • L. CW
  • Symp . on Foundations of Computer Science
  • 1980

PAPADIMITRIOU, The complexity of coloring circular arcs and chords

  • G. L. MILLER, H C.
  • SIAM J. Algebraic Discrete Method
  • 1980

BERNHART AND B. KAINEN, The book thickness of a graph

  • F. CBCI
  • J. Combin. Ser. B
  • 1979

TARJAN, Sorting using networks of queues and stacks

  • R E.
  • J. Assoc. Comput. Mach
  • 1972

Similar Papers

Loading similar papers…