2014年
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
COMPUTING AND COMBINATORICS, COCOON 2014
- ,
- 巻
- 8591
- 号
- 開始ページ
- 477
- 終了ページ
- 488
- 記述言語
- 英語
- 掲載種別
- DOI
- 10.1007/978-3-319-08783-2_41
- 出版者・発行元
- SPRINGER-VERLAG BERLIN
In this paper, we study the problem of testing whether a given graph admits a 2-page book embedding with a fixed edge partition. We first show that finding a 2-page book embedding of a given graph can be reduced to the planarity testing of a graph, which yields a simple linear-time algorithm for solving the problem. We then characterize the graphs that do not admit 2-page book embeddings via forbidden subgraphs, and give a linear-time algorithm for detecting the forbidden subgraph of a given graph.
- リンク情報
- ID情報
-
- DOI : 10.1007/978-3-319-08783-2_41
- ISSN : 0302-9743
- Web of Science ID : WOS:000343883800041