標題: Titlebook: Computational Geometry and Graphs; Thailand-Japan Joint Jin Akiyama,Mikio Kano,Toshinori Sakai Conference proceedings 2013 Springer-Verlag [打印本頁] 作者: 導彈 時間: 2025-3-21 16:36
書目名稱Computational Geometry and Graphs影響因子(影響力)
書目名稱Computational Geometry and Graphs影響因子(影響力)學科排名
書目名稱Computational Geometry and Graphs網(wǎng)絡公開度
書目名稱Computational Geometry and Graphs網(wǎng)絡公開度學科排名
書目名稱Computational Geometry and Graphs被引頻次
書目名稱Computational Geometry and Graphs被引頻次學科排名
書目名稱Computational Geometry and Graphs年度引用
書目名稱Computational Geometry and Graphs年度引用學科排名
書目名稱Computational Geometry and Graphs讀者反饋
書目名稱Computational Geometry and Graphs讀者反饋學科排名
作者: 法律的瑕疵 時間: 2025-3-22 00:09
Colored Quadrangulations with Steiner Points, graph . with vertex set . such that the boundary of the unbounded face of . coincides with CH(.) and that each bounded face of . is quadrilateral, where CH(.) stands for the boundary of the convex hull of .. It is easily checked that in general not every .-colored . admits a .-colored quadrangulati作者: 柔聲地說 時間: 2025-3-22 01:17
On Universal Point Sets for Planar Graphs,rov, we show that there is no .-universal point set of size ., for any .?≥?15. Conversely, we use a computer program to show that there exist universal point sets for all .?≤?10 and to enumerate all corresponding order types. Finally, we describe a collection . of 7′393 planar graphs on 35 vertices 作者: tenuous 時間: 2025-3-22 05:24
On Non 3-Choosable Bipartite Graphs,que 3-list assignment . up to renaming the colors such that . . is not .-colorable. We present our strategies which can be applied to obtain another proof of their result. These strategies are invented to claim a stronger result that every complete bipartite graph with fifteen vertices except . . is作者: 頭盔 時間: 2025-3-22 11:54 作者: Palate 時間: 2025-3-22 16:29
On Complexity of Flooding Games on Graphs with Interval Representations,se games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider the coloring games on general graphs: Once a vertex is colored, the 作者: Palate 時間: 2025-3-22 18:13
,How to Generalize Janken – Rock-Paper-Scissors-King-Flea,ld. A variant of janken can be represented by a tournament, where a vertex corresponds a sign and an arc (.,.) means sign . defeats sign .. However, not all tournaments define useful janken variants, i.e., some janken variants may include a useless sign, which is strictly inferior than another sign 作者: 瘋狂 時間: 2025-3-22 22:27 作者: 變色龍 時間: 2025-3-23 04:32
,GDDs with Two Associate Classes and with Three Groups of Sizes 1, ,, , and ,,?
作者: Pandemic 時間: 2025-3-23 08:50
The Number of Diagonal Transformations in Quadrangulations on the Sphere, unique bipartition .(.)?=?.?∪?., where we call (|.|,|.|) the . of .. In this article, we shall prove that any two quadrangulations . and .′ with the same bipartition size can be transformed into each other by at most 10|.|?+?16|.|???64 diagonal slides.作者: 不可磨滅 時間: 2025-3-23 12:24
,Remarks on Schur’s Conjecture,ength diam(.), whose every vertex belongs to ., is .. We prove this statement under the condition that any two of the simplices share at least .???2 vertices. It is left as an open question to decide whether this condition is always satisfied. We also establish upper bounds on the number of all 2- a作者: 迅速成長 時間: 2025-3-23 17:21
Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction inof flow enter edge .?=?(., .) at ., then .(.) .(.) units of flow arrive at .. Since relation extraction, which is an important application of the problem, uses large networks such as Wikipedia and DBLP, the computation time to solve the problem is important. However, conventional algorithms for the 作者: Blasphemy 時間: 2025-3-23 20:21
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian,e similar to the well known Hall’s theorem, which concerns the existence of a perfect matching. Based on the condition we also give a polynomial-time algorithm for the Hamilton cycle problem on bipartite distance-hereditary graphs.作者: 搜尋 時間: 2025-3-24 00:56 作者: 下級 時間: 2025-3-24 02:47 作者: neurologist 時間: 2025-3-24 10:28
Random Sets (in Particular Boolean Models), unique bipartition .(.)?=?.?∪?., where we call (|.|,|.|) the . of .. In this article, we shall prove that any two quadrangulations . and .′ with the same bipartition size can be transformed into each other by at most 10|.|?+?16|.|???64 diagonal slides.作者: 花束 時間: 2025-3-24 14:08 作者: 時代錯誤 時間: 2025-3-24 15:27
Fran?ois Gay-Balmaz,Vakhtang PutkaradzeIn addition to the well-known classification of 3-dimensional parallelohedra we describe this important class of polytopes classified by the affine equivalence relation and parametrize representatives of their equivalent classes.作者: 不可救藥 時間: 2025-3-24 21:54 作者: Glucose 時間: 2025-3-25 00:57
https://doi.org/10.1007/978-94-011-3760-7nged to form . and . respectively, under certain conditions. A polygon . is said to be reversible if there exists a polygon . such that the pair . and . is reversible. This paper discusses operators which preserve reversibility for polygons. All reversible polygons are classified into seven equivale作者: Goblet-Cells 時間: 2025-3-25 05:15 作者: Macronutrients 時間: 2025-3-25 10:28
Stochastic Games and Related Conceptsrov, we show that there is no .-universal point set of size ., for any .?≥?15. Conversely, we use a computer program to show that there exist universal point sets for all .?≤?10 and to enumerate all corresponding order types. Finally, we describe a collection . of 7′393 planar graphs on 35 vertices 作者: Comprise 時間: 2025-3-25 15:38 作者: 去世 時間: 2025-3-25 18:41 作者: 修飾 時間: 2025-3-25 22:45
Jean-Fran?ois Coeurjolly,Frédéric Lavancierse games, each player colors one specified cell in his/her turn, and all connected neighbor cells of the same color are also colored by the color. This flooding or coloring spreads on the same color cells. It is natural to consider the coloring games on general graphs: Once a vertex is colored, the 作者: 改進 時間: 2025-3-26 03:59 作者: 的事物 時間: 2025-3-26 06:41
https://doi.org/10.1007/3-540-38174-0instra proved that if a connected graph . satisfies . .(.)?≥?|.|???.?+?1 for an integer .?≥?2, then . has a spanning tree having at most . leaves. In this paper we improve this result as follows. If a connected graph . satisfies . .(.)?≥?|.|???.?+?1 and |.|?≥?3.???10 for an integer .?≥?2, then . has作者: 籠子 時間: 2025-3-26 12:10 作者: 調(diào)情 時間: 2025-3-26 13:40 作者: 等待 時間: 2025-3-26 17:50
https://doi.org/10.1007/3-540-38174-0ength diam(.), whose every vertex belongs to ., is .. We prove this statement under the condition that any two of the simplices share at least .???2 vertices. It is left as an open question to decide whether this condition is always satisfied. We also establish upper bounds on the number of all 2- a作者: abolish 時間: 2025-3-26 23:39
Random Sets (in Particular Boolean Models),of flow enter edge .?=?(., .) at ., then .(.) .(.) units of flow arrive at .. Since relation extraction, which is an important application of the problem, uses large networks such as Wikipedia and DBLP, the computation time to solve the problem is important. However, conventional algorithms for the 作者: Glossy 時間: 2025-3-27 04:53 作者: 察覺 時間: 2025-3-27 07:21 作者: Digitalis 時間: 2025-3-27 13:24
Jin Akiyama,Mikio Kano,Toshinori SakaiHigh quality selected papers.Unique visibility.State of the art research作者: 是突襲 時間: 2025-3-27 17:25 作者: phlegm 時間: 2025-3-27 18:54
The Number of Diagonal Transformations in Quadrangulations on the Sphere, unique bipartition .(.)?=?.?∪?., where we call (|.|,|.|) the . of .. In this article, we shall prove that any two quadrangulations . and .′ with the same bipartition size can be transformed into each other by at most 10|.|?+?16|.|???64 diagonal slides.作者: BOOR 時間: 2025-3-28 01:09
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian,e similar to the well known Hall’s theorem, which concerns the existence of a perfect matching. Based on the condition we also give a polynomial-time algorithm for the Hamilton cycle problem on bipartite distance-hereditary graphs.作者: 輕浮思想 時間: 2025-3-28 05:40 作者: medieval 時間: 2025-3-28 09:16
https://doi.org/10.1007/978-3-642-45281-9bipartite graphs; information networks; planar graphs; point sets; trees; algorithm analysis and problem 作者: reptile 時間: 2025-3-28 10:48
978-3-642-45280-2Springer-Verlag Berlin Heidelberg 2013作者: Intentional 時間: 2025-3-28 18:32
Conference proceedings 2013kok, Thailand, in December 2012..The 15 original research papers presented were selected from among six plenary talks, one special public talk and 41 talks by participants from about 20 countries around the world. TJJCCGG 2012 provided a forum for researchers working in computational geometry, graph作者: Tartar 時間: 2025-3-28 21:24
0302-9743 Joint Conference on Computational Geometry and Graphs, TJJCCGG 2012, held in Bangkok, Thailand, in December 2012..The 15 original research papers presented were selected from among six plenary talks, one special public talk and 41 talks by participants from about 20 countries around the world. TJJC作者: FLORA 時間: 2025-3-29 00:30
https://doi.org/10.1007/978-94-011-3760-7 . is reversible. This paper discusses operators which preserve reversibility for polygons. All reversible polygons are classified into seven equivalence classes . (.?=?1, 2, …, 7) under the equivalence relation ≡, where .?≡?. means that there exists some operator . such that .?=?.(.).作者: jumble 時間: 2025-3-29 06:44 作者: 手勢 時間: 2025-3-29 09:58
Stochastic Games and Related Conceptsroof of their result. These strategies are invented to claim a stronger result that every complete bipartite graph with fifteen vertices except . . is 3-choosable. We also show all 3-list assignments . such that . . is not .-colorable.作者: 污點 時間: 2025-3-29 12:15 作者: extinct 時間: 2025-3-29 16:43 作者: 為現(xiàn)場 時間: 2025-3-29 21:34 作者: 設想 時間: 2025-3-30 03:34
Operators which Preserve Reversibility, . is reversible. This paper discusses operators which preserve reversibility for polygons. All reversible polygons are classified into seven equivalence classes . (.?=?1, 2, …, 7) under the equivalence relation ≡, where .?≡?. means that there exists some operator . such that .?=?.(.).作者: ARCHE 時間: 2025-3-30 04:20 作者: 包庇 時間: 2025-3-30 09:36
On Non 3-Choosable Bipartite Graphs,roof of their result. These strategies are invented to claim a stronger result that every complete bipartite graph with fifteen vertices except . . is 3-choosable. We also show all 3-list assignments . such that . . is not .-colorable.作者: 草率男 時間: 2025-3-30 12:46 作者: 聽寫 時間: 2025-3-30 16:42 作者: 過份好問 時間: 2025-3-30 22:10
On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets,prove the complexity from .(....) to .(..?+?..) by proposing a simplified deformation process. This improvement greatly reduces the program running time and unnecessary topology changes. Moreover, it makes some impossible deformation with large input sets to become possible.作者: cornucopia 時間: 2025-3-31 04:41
Real Algebraic Tools in Stochastic Games,y color among the . colors. In this paper, we show that if . satisfies some condition for colors of the points in the convex hull, then a .-colored quadrangulation of . can always be constructed using less than . Steiner points. Our upper bound improves the known upper bound for . = 3, and gives the first bounds for .?≥?4.作者: Carcinoma 時間: 2025-3-31 08:08
Jean-Fran?ois Coeurjolly,Frédéric Lavancier studied. We investigate the one player flooding games on some graph classes characterized by interval representations. Our results state that the number of colors is a key parameter to determine the computational complexity of the flooding games.作者: Hemiparesis 時間: 2025-3-31 10:07
Colored Quadrangulations with Steiner Points,y color among the . colors. In this paper, we show that if . satisfies some condition for colors of the points in the convex hull, then a .-colored quadrangulation of . can always be constructed using less than . Steiner points. Our upper bound improves the known upper bound for . = 3, and gives the first bounds for .?≥?4.作者: Obstreperous 時間: 2025-3-31 14:26
On Complexity of Flooding Games on Graphs with Interval Representations, studied. We investigate the one player flooding games on some graph classes characterized by interval representations. Our results state that the number of colors is a key parameter to determine the computational complexity of the flooding games.
