Upward straight-line embeddings of directed graphs into point sets
DOI10.1016/J.COMGEO.2009.07.002zbMATH Open1221.05175DBLPjournals/comgeo/BinucciGDEFKL10OpenAlexW2031551728WikidataQ62042532 ScholiaQ62042532MaRDI QIDQ1037786FDOQ1037786
Authors: Carla Binucci, Emilio Di Giacomo, Walter Didimo, Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov, Giuseppe Liotta 
Publication date: 16 November 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.07.002
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- How to draw a planar graph on a grid
- Area requirement and symmetry display of planar upward drawings
- Title not available (Why is that?)
- Optimal Algorithms to Embed Trees in a Point Set
- Algorithms for plane representations of acyclic digraphs
- Upward straight-line embeddings of directed graphs into point sets
- On embedding an outer-planar graph in a point set
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Book embeddability of series-parallel digraphs
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
Cited In (15)
- Upward straight-line embeddings of directed graphs into point sets
- Upward geometric graph embeddings into point sets
- Upward point set embeddability for convex point sets is in P
- Small universal point sets for \(k\)-outerplanar graphs
- On upward point set embeddability
- Computing upward topological book embeddings of upward planar digraphs
- Upward point set embeddings of paths and trees
- Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
- Upward Point-Set Embeddability
- The point-set embeddability problem for plane graphs
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- Colored anchored visibility representations in 2D and 3D space
- Upward topological book embeddings of DAGs
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
This page was built for publication: Upward straight-line embeddings of directed graphs into point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037786)
