On upward straight-line embeddings of oriented paths
暂无分享,去创建一个
Jorge Urrutia | Gelasio Salazar | Miguel Raggi | Edgardo Roldán-Pensado | Onur Cagirici | Leonardo Casuso | Medina Carolina
[1] Stephen G. Kobourov,et al. Upward Straight-Line Embeddings of Directed Graphs into Point Sets , 2008, WG.
[2] János Pach,et al. How to draw a planar graph on a grid , 1990, Comb..
[3] Prosenjit Bose,et al. On Embedding an Outer-Planar Graph in a Point Set , 1997, GD.
[4] Tamara Mchedlidze. Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points , 2014, Comput. Geom..
[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[6] Sergio Cabello. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard , 2006, J. Graph Algorithms Appl..
[7] Michael Kaufmann,et al. Upward Geometric Graph Embeddings into Point Sets , 2010, Graph Drawing.
[8] Tamara Mchedlidze,et al. Embedding Four-Directional Paths on Convex Point Sets , 2014, Graph Drawing.
[9] R. Pollack,et al. Embedding a planar triangulation with vertices at specified points , 1991 .
[10] Maciej Kurowski. A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs , 2004, Inf. Process. Lett..
[11] Prosenjit Bose,et al. Journal of Graph Algorithms and Applications , 2022 .