Titlebook: ;

Addendum

书目名称Graph Drawing and Network Visualization影响因子(影响力)




书目名称Graph Drawing and Network Visualization影响因子(影响力)学科排名




书目名称Graph Drawing and Network Visualization网络公开度




书目名称Graph Drawing and Network Visualization网络公开度学科排名




书目名称Graph Drawing and Network Visualization被引频次




书目名称Graph Drawing and Network Visualization被引频次学科排名




书目名称Graph Drawing and Network Visualization年度引用




书目名称Graph Drawing and Network Visualization年度引用学科排名




书目名称Graph Drawing and Network Visualization读者反馈




书目名称Graph Drawing and Network Visualization读者反馈学科排名

confederacy

https://doi.org/10.1007/978-94-011-1922-1g. We show non-trivial relationships between the ply number and the vertex-ply number. Then, we focus on empty-ply drawings, proving some properties and studying what classes of graphs admit such drawings. Finally, we prove a lower bound on the ply and the vertex-ply of planar drawings.

Biomarker

languid

变量

Aligned Drawings of Planar Graphscribed convex drawing of the outer face. We also study the more general version of the problem where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is .-hard but fixed-parameter tractable.

Affable

Affable

完整

Grid-Obstacle Representations with Connections to Staircase Guardingow that then grid-obstacle representations exist for bipartite graphs. The latter has applications in so-called . of orthogonal polygons; using our grid-obstacle representations, we show that staircase guarding is .-hard in 2D.

VOK

On the Edge-Length Ratio of Outerplanar Graphs.. We also show that every bipartite outerplanar graph has a planar straight-line drawing with edge-length ratio 1, and that, for any ., there exists an outerplanar graph with a given combinatorial embedding such that any planar straight-line drawing has edge-length ratio greater than ..

智力高