38 citations · 77 across the 28 of their papers we have counts for
Showing 2009 · cs.DSShow all
2 papers · 2 filters
cs.DS2009
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
Tamara Mchedlidze, Antonios Symvonis
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 co…
cs.DS2009
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
Tamara Mchedlidze, Antonios Symvonis
Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM) to be the problem of determining…