On ρ-constrained upward topological book embeddings

Tamara McHedlidze; Antonios Symvonis

Conference ProceedingsOPEN ACCESS

On ρ-constrained upward topological book embeddings

McHedlidze T
Symvonis A

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5849 LNCS 411-412

DOI: 10.1007/978-3-642-11805-0_40

5Citations

4Readers

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

McHedlidze, T., & Symvonis, A. (2010). On ρ-constrained upward topological book embeddings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 411–412). https://doi.org/10.1007/978-3-642-11805-0_40

On ρ-constrained upward topological book embeddings

Abstract

Cite

Register to see more suggestions