Embeddability Problems for Upward Planar Digraphs

DOI10.1007/978-3-642-00219-9_23zbMath1213.68450OpenAlexW1778319251MaRDI QIDQ3611856

Francesco Giordano, Giuseppe Liotta, S. H. Whitesides

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_23

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) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Upward Point Set Embeddability for Convex Point Sets Is in P ⋮ On upward point set embeddability ⋮ Computing upward topological book embeddings of upward planar digraphs

Cites Work

• Unnamed Item
• Algorithms for plane representations of acyclic digraphs
• On the combinatorial classification of nondegenerate configurations in the plane
• On the thickness of graphs of given degree
• Drawing Colored Graphs on Colored Points
• Level Planar Embedding in Linear Time
• Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
• Computing Upward Topological Book Embeddings of Upward Planar Digraphs
• Constrained Simultaneous and Near-Simultaneous Embeddings
• Drawing graphs. Methods and models
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Embeddability Problems for Upward Planar Digraphs