2 research outputs found
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
In this paper we study the problem of existence of a crossing-free acyclic
hamiltonian path completion (for short, HP-completion) set for embedded upward
planar digraphs. In the context of book embeddings, this question becomes:
given an embedded upward planar digraph , determine whether there exists an
upward 2-page book embedding of preserving the given planar embedding.
Given an embedded -digraph which has a crossing-free HP-completion
set, we show that there always exists a crossing-free HP-completion set with at
most two edges per face of . For an embedded -free upward planar digraph
, we show that there always exists a crossing-free acyclic HP-completion set
for which, moreover, can be computed in linear time. For a width-
embedded planar -digraph , we show that we can be efficiently test
whether admits a crossing-free acyclic HP-completion set.Comment: Accepted to ISAAC200