On rho-Constrained 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-01T02:51:53Z
dc.date.available	2014-03-01T02:51:53Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35722
dc.subject	Book Embedding	en
dc.title	On rho-Constrained Upward Topological Book Embeddings	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-11805-0_40	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-11805-0_40	en
heal.publicationDate	2009	en
heal.abstract	Giordano, Liotta and Whitesides [1] developed an algorithm that, given an embedded planar st-digraph and a topological numbering ρ of its vertices, computes in O(n2) time a ρ-constrained upward topological book embedding with at most 2n–4 spine crossings per edge. The number of spine crossings per edge is asymptotically worst case optimal.	en
heal.journalName	Symposium on Graph Drawing	en
dc.identifier.doi	10.1007/978-3-642-11805-0_40	en