Titlebook: Discrete and Computational Geometry, Graphs, and Games; 21st Japanese Confer Jin Akiyama,Reginaldo M. Marcelo,Yushi Uno Conference proceedi

正当理由

书目名称Discrete and Computational Geometry, Graphs, and Games影响因子(影响力)




书目名称Discrete and Computational Geometry, Graphs, and Games影响因子(影响力)学科排名




书目名称Discrete and Computational Geometry, Graphs, and Games网络公开度




书目名称Discrete and Computational Geometry, Graphs, and Games网络公开度学科排名




书目名称Discrete and Computational Geometry, Graphs, and Games被引频次




书目名称Discrete and Computational Geometry, Graphs, and Games被引频次学科排名




书目名称Discrete and Computational Geometry, Graphs, and Games年度引用




书目名称Discrete and Computational Geometry, Graphs, and Games年度引用学科排名




书目名称Discrete and Computational Geometry, Graphs, and Games读者反馈




书目名称Discrete and Computational Geometry, Graphs, and Games读者反馈学科排名

dagger

不舒服

行为

Negative Instance for the Edge Patrolling Beacon Problem,ni and Rappaport [JCDCG 2017] 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.

两栖动物

,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.

斑驳

斑驳

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

相互影响

deficiency

莎草