Computing Upward Topological Book Embeddings of Upward Planar Digraphs

DOI10.1007/978-3-540-77120-3_17MaRDI QIDQ5387755zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77120-3_17

Mathematics Subject Classification ID

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

Recommendations

• Computing upward topological book embeddings of upward planar digraphs
• Book embeddability of series-parallel digraphs
• scientific article; zbMATH DE number 1974117
• Embeddability Problems for Upward Planar Digraphs
• Spine Crossing Minimization in Upward Topological Book Embeddings

Cites work

• Algorithms for plane representations of acyclic digraphs
• Book embeddability of series-parallel digraphs
• Computing Upward Topological Book Embeddings of Upward Planar Digraphs
• Constrained visibility representations of graphs
• Curve-constrained drawings of planar graphs
• Drawing graphs. Methods and models
• Embedding Graphs Simultaneously with Fixed Edges
• Embedding planar graphs in four pages
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Fundamentals of planar ordered sets
• Graph Drawing
• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• 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 simultaneous planar graph embeddings
• Optimal Algorithms to Embed Trees in a Point Set
• Ordered sets, pagenumbers and planarity
• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
• Simultaneous Embedding of Planar Graphs with Few Bends
• Simultaneous Graph Embedding with Bends and Circular Arcs
• 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
• Upward Planar Drawings and Switch-regularity Heuristics

Cited in

(16)

• Upward straight-line embeddings of directed graphs into point sets
• On upward point set embeddability
• Computing upward topological book embeddings of upward planar digraphs
• Upward Point-Set Embeddability
• Upward topological book embeddings of DAGs
• Upward point set embeddability for convex point sets is in P
• Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
• Embeddability Problems for Upward Planar Digraphs
• Spine Crossing Minimization in Upward Topological Book Embeddings
• Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs
• scientific article; zbMATH DE number 1974117 (Why is no real title available?)
• Upward partitioned book embeddings
• Upward book embeddings of st-graphs
• Upward Straight-Line Embeddings of Directed Graphs into Point Sets
• Computing Upward Topological Book Embeddings of Upward Planar Digraphs
• Drawing colored graphs with constrained vertex positions and few bends per edge

This page was built for publication: Computing Upward Topological Book Embeddings of Upward Planar Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387755)