Computing upward topological book embeddings of upward planar digraphs

DOI10.1016/j.jda.2014.11.006zbMath1320.68129OpenAlexW2087236754WikidataQ62042380 ScholiaQ62042380MaRDI QIDQ2253904

Tamara Mchedlidze, Giuseppe Liotta, Antonios Symvonis, Francesco Giordano, S. H. Whitesides

Publication date: 13 February 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.11.006

zbMATH Keywords

graph drawingupward point-set embeddingsupward simultaneous embeddingsupward topological book embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

A Sublinear Bound on the Page Number of Upward Planar Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ The Bundled Crossing Number ⋮ Upward Book Embeddings of st-Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Curve-constrained drawings of planar graphs
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
• On simultaneous planar graph embeddings
• Ordered sets, pagenumbers and planarity
• Simultaneous graph embedding with bends and circular arcs
• Drawing colored graphs on colored points
• Upward drawings of triconnected digraphs.
• Two trees which are self-intersecting when drawn simultaneously
• Upward straight-line embeddings of directed graphs into point sets
• Fundamentals of planar ordered sets
• Embedding planar graphs in four pages
• Algorithms for plane representations of acyclic digraphs
• The book thickness of a graph
• On the combinatorial classification of nondegenerate configurations in the plane
• On the thickness of graphs of given degree
• Constrained visibility representations of graphs
• Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
• On embedding an outer-planar graph in a point set
• On upward point set embeddability
• Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
• Book embeddability of series-parallel digraphs
• Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
• Upward Geometric Graph Embeddings into Point Sets
• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
• Embedding Graphs Simultaneously with Fixed Edges
• Embeddability Problems for Upward Planar Digraphs
• Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Stack and Queue Layouts of Posets
• Optimal Algorithms to Embed Trees in a Point Set
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Level Planar Embedding in Linear Time
• Simultaneous Embedding of Planar Graphs with Few Bends
• Upward Planar Drawings and Switch-regularity Heuristics
• Computing Upward Topological Book Embeddings of Upward Planar Digraphs
• Drawing graphs. Methods and models
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Computing upward topological book embeddings of upward planar digraphs