Crossing-optimal acyclic HP-completion for outerplanar st-digraphs

McHedlidze, T; Symvonis, A

dc.contributor.author	McHedlidze, T	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T02:46:05Z
dc.date.available	2014-03-01T02:46:05Z
dc.date.issued	2009	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32538
dc.subject	Book Embedding	en
dc.subject	Hamiltonian Path	en
dc.subject	Linear Time Algorithm	en
dc.subject	Optimal Algorithm	en
dc.subject.other	Acyclic digraph	en
dc.subject.other	Crossing minimization	en
dc.subject.other	Edge crossing	en
dc.subject.other	Embeddings	en
dc.subject.other	Hamiltonian path	en
dc.subject.other	Linear-time algorithms	en
dc.subject.other	Optimal solutions	en
dc.subject.other	Polygon decomposition	en
dc.subject.other	Optimization	en
dc.subject.other	Hamiltonians	en
dc.title	Crossing-optimal acyclic HP-completion for outerplanar st-digraphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-02882-3_9	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-02882-3_9	en
heal.publicationDate	2009	en
heal.abstract	Given an embedded planar acyclic digraph G, the acyclic hamiltonian path completion with crossing minimization (Acyclic- HPCCM) problem is to determine a hamiltonian path completion set of edges such that, when these edges are embedded on G, they create the smallest possible number of edge crossings and turn G to a hamiltonian acyclic digraph. In this paper, we present a linear time algorithm which solves the Acyclic-HPCCM problem on any outerplanar st-digraph G. The algorithm is based on properties of the optimal solution and an st-polygon decomposition of G. As a consequence of our result, we can obtain for the class of outerplanar st-digraphs upward topological 2-page book embeddings with minimum number of spine crossings. © 2009 Springer Berlin Heidelberg.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-02882-3_9	en
dc.identifier.volume	5609 LNCS	en
dc.identifier.spage	76	en
dc.identifier.epage	85	en