Addendum
发表于 2025-3-21 18:29:57
书目名称Graph Drawing and Network Visualization影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0387920<br><br> <br><br>书目名称Graph Drawing and Network Visualization读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0387920<br><br> <br><br>
confederacy
发表于 2025-3-21 22:25:43
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
发表于 2025-3-22 00:59:55
http://reply.papertrans.cn/39/3880/387920/387920_3.png
languid
发表于 2025-3-22 08:09:49
http://reply.papertrans.cn/39/3880/387920/387920_4.png
变量
发表于 2025-3-22 08:56:56
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
发表于 2025-3-22 13:23:36
http://reply.papertrans.cn/39/3880/387920/387920_6.png
Affable
发表于 2025-3-22 17:18:23
http://reply.papertrans.cn/39/3880/387920/387920_7.png
完整
发表于 2025-3-23 00:33:15
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
发表于 2025-3-23 01:25:36
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 ..
智力高
发表于 2025-3-23 06:51:32
http://reply.papertrans.cn/39/3880/387920/387920_10.png