Article ID Journal Published Year Pages File Type
6875525 Theoretical Computer Science 2018 20 Pages PDF
Abstract
As an application of our main result, we also show that our book embedding results imply an alternative proof that the clustered planarity problem with two clusters can be solved in linear time.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Simpler algorithms for testing two-page book embedding of partitioned graphs
Authors
, ,