On ρ-Constrained Upward Topological Book Embeddings

  • Tamara Mchedlidze
  • Antonios Symvonis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5849)


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.


Hamiltonian Path External Face Embeddability Problem Embed Graph Edge Crossing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Giordano, F., Liotta, G., Whitesides, S.H.: Embeddability Problems for Upward Planar Digraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 242–253. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Mchedlidze, T., Symvonis, A.: Crossing-optimal acyclic hamiltonian path completion and its application to upward topological book embeddings. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 250–261. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Tamara Mchedlidze
    • 1
  • Antonios Symvonis
    • 1
  1. 1.Dept. of MathematicsNational Technical University of AthensAthensGreece

Personalised recommendations