Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)

Mchedlidze, T; Symvonis, A

dc.contributor.author	Mchedlidze, T	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:56:59Z
dc.date.available	2014-03-01T01:56:59Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28283
dc.relation.uri	http://arxiv.org/abs/0807.2330	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr0807.html#abs-0807-2330	en
dc.subject	Book Embedding	en
dc.subject	Hamiltonian Path	en
dc.subject	Linear Time Algorithm	en
dc.subject	Optimal Algorithm	en
dc.title	Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)	en
heal.type	journalArticle	en
heal.publicationDate	2008	en
heal.abstract	Given an embedded planar acyclic digraph G, we define the problem of "acyclichamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to bethe problem of determining an hamiltonian path completion set of edges suchthat, when these edges are embedded on G, they create the smallest possiblenumber of edge crossings and turn G to a hamiltonian digraph. Our results	en
heal.journalName	Computing Research Repository	en