正当理由
发表于 2025-3-21 19:25:26
书目名称Discrete and Computational Geometry, Graphs, and Games影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0281183<br><br> <br><br>书目名称Discrete and Computational Geometry, Graphs, and Games读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0281183<br><br> <br><br>
dagger
发表于 2025-3-21 23:02:17
http://reply.papertrans.cn/29/2812/281183/281183_2.png
不舒服
发表于 2025-3-22 01:33:54
http://reply.papertrans.cn/29/2812/281183/281183_3.png
行为
发表于 2025-3-22 05:13:50
Negative Instance for the Edge Patrolling Beacon Problem,ni and Rappaport gave an algorithm for determining whether a ball-capturing beacon strategy exists, while conjecturing that such a strategy always exists. We disprove this conjecture by constructing orthogonal and general-position polygons in which the ball and the beacon can never be united.
两栖动物
发表于 2025-3-22 12:32:40
,Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number – A Survey,ave such properties. Since every .-connected graph on a surface . satisfies some toughness and scattering number condition, we can expect that “every .-connected graph on a surface . satisfies the property .”. We explain which triple . makes the statement true from the viewpoint of toughness and scattering number of graphs.
斑驳
发表于 2025-3-22 15:17:11
http://reply.papertrans.cn/29/2812/281183/281183_6.png
斑驳
发表于 2025-3-22 20:15:08
0302-9743 ewed and selected from 25 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.978-3-030-90047-2978-3-030-90048-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
相互影响
发表于 2025-3-22 21:39:24
http://reply.papertrans.cn/29/2812/281183/281183_8.png
deficiency
发表于 2025-3-23 02:54:21
http://reply.papertrans.cn/29/2812/281183/281183_9.png
莎草
发表于 2025-3-23 06:19:29
http://reply.papertrans.cn/29/2812/281183/281183_10.png