Parameterized Algorithms for Book Embedding Problems
A $k$-page book embedding of a graph $G$ draws the vertices of $G$ on a line and the edges on $k$ half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether $G$ admits a $k$-page book embedding both when the linear orde...
Saved in:
| Published in: | Journal of graph algorithms and applications Vol. 24; no. 4; pp. 603 - 620 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.12.2020
|
| ISSN: | 1526-1719, 1526-1719 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!