An O(mn) Algorithm for Embedding Graphs into a 3-Page Book (Special Section on the 6th Karuizawa Workshop on Circuits and Systems)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper studies the problem of embedding a graph into a book with nodes on a line along the spine of the book and edges on the pages in such a way that no edge crosses another. Atneosen as well as Bernhart and Kainen has shown that every graph can be embedded into a 3-page book when each edge can be embedded in more than one page. The time complexity of Bernhart and Kainen's Ω(ν(G)), where ν(G) is the crossing number of a graph G. A new O(mn) algorithm is derived in this paper for embedding a graph G=(V,E), where m=|E|and n=|V|. The number of points at which edges cross over the spine in embedding a complete graph into a 3-page book is also investigated.

• 一般社団法人電子情報通信学会の論文
• 1994-03-25

著者

• Miyauchi Miki

  NTT Basic Research Laboratories

関連論文

• An O(mn) Algorithm for Embedding Graphs into a 3-Page Book (Special Section on the 6th Karuizawa Workshop on Circuits and Systems)

スポンサーリンク