標(biāo)題: Titlebook: Computational Geometry and Graph Theory; International Confer Hiro Ito,Mikio Kano,Yushi Uno Conference proceedings 2008 Springer-Verlag Ber [打印本頁(yè)] 作者: 滋養(yǎng)物質(zhì) 時(shí)間: 2025-3-21 19:47
書(shū)目名稱(chēng)Computational Geometry and Graph Theory影響因子(影響力)
書(shū)目名稱(chēng)Computational Geometry and Graph Theory影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Computational Geometry and Graph Theory網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Computational Geometry and Graph Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Computational Geometry and Graph Theory被引頻次
書(shū)目名稱(chēng)Computational Geometry and Graph Theory被引頻次學(xué)科排名
書(shū)目名稱(chēng)Computational Geometry and Graph Theory年度引用
書(shū)目名稱(chēng)Computational Geometry and Graph Theory年度引用學(xué)科排名
書(shū)目名稱(chēng)Computational Geometry and Graph Theory讀者反饋
書(shū)目名稱(chēng)Computational Geometry and Graph Theory讀者反饋學(xué)科排名
作者: Demulcent 時(shí)間: 2025-3-21 22:07
Mortgage Valuation and Optimal Refinancingo gaps and no (2-dimensional) overlaps. Let . be a doubly covered square, that is, a flat polygon consisting of two congruent square faces joined together along each of their corresponding edges. We prove that for every development (unfolding) . of ., there is a tiling of congruent copies of . whose作者: 得罪人 時(shí)間: 2025-3-22 03:15 作者: 拋媚眼 時(shí)間: 2025-3-22 04:55
Summary and Concluding Remarks,lations, and that any infinite deflation sequence of a pentagon results from deflating an induced quadrilateral on four of the vertices. We describe a family of hexagons that deflate infinitely for a specific deflation sequence, yet induce no infinitely deflating quadrilateral. We also review the kn作者: 倒轉(zhuǎn) 時(shí)間: 2025-3-22 10:29 作者: Ccu106 時(shí)間: 2025-3-22 12:52
Renata J. Romanowicz,Marzena Osuchf the state of vertex ., and each neighbor of ., from 0 to 1, or from 1 to 0. The given initial state of . is said to be . if a sequence of moves exists such that this state is transformed into the 0-state (all vertices have state 0.) If every initial state of . is solvable, we call . a .. We shall 作者: Ccu106 時(shí)間: 2025-3-22 19:46
Stochastic Flood Forecasting System contains . as a subgraph or . contains . as a subgraph. In this paper, we investigate the Ramsey numbers for stars versus small cycle. We show that .(..,..)?=?10 and .(..,..)?=?.(.?+?1)?+?1 for .?≥?2 and .?≥?3.作者: oblique 時(shí)間: 2025-3-22 21:34
https://doi.org/10.1007/978-3-319-18854-6 and no element of . lies inside .. Let .(..,..,???,..) be the smallest integer such that any set of .(..,???,..) points contains a ..-hole for each ., 1?≤?.?≤?., where the holes are pairwise disjoint. We evaluate such values. In particular, we show that .(1,2,3,4,5)?=?15.作者: 良心 時(shí)間: 2025-3-23 01:30 作者: 虛假 時(shí)間: 2025-3-23 08:09
Stochastic Flood Forecasting Systemraphs, fractional (.,.)-factors and fractional colorings are presented. The relationships of the programming and the graph theory are discussed. In particular, some new results related to fractional (.,.)-factors obtained by us are given. Furthermore, some open problems are presented.作者: 抱怨 時(shí)間: 2025-3-23 12:33
Stochastic Flood Forecasting Systempherical triangles in .., and calculate the probabilities of seven types to which random spherical triangles belong. Each probability monotone converges to a certain value as the dimension . tends to infinity. As an application, we can estimate the expectation of numbers of division on acute triangu作者: TRAWL 時(shí)間: 2025-3-23 15:23
Stochastic Flows and Jump-Diffusionsof bipartite graph subdivisions. Recently Dujmovi? and Wood showed that every graph . with . vertices has a (3,2)-track subdivision of . with 4 ?log.(.) ??+?3 division vertices per edge, where .(.) is the queue number of .. This paper improves their result for the case of complete bipartite graphs, 作者: 使迷惑 時(shí)間: 2025-3-23 18:10
Probability Theory and Stochastic Modelling such that a sub(di)graph is fixed by . while its complement carries a free action. A branched regular covering of a (di)graph is a (di)graph, where vertices are either regular (free orbits) or totally ramified (fixed vertices). Deng, Sato and Wu treated the characteristic polynomial of a branched c作者: Choreography 時(shí)間: 2025-3-24 00:24 作者: 控制 時(shí)間: 2025-3-24 04:21
Stochastic Foundations in Movement Ecologygive several results concerning the minimum number of operations that delete two crossing edges, add two other edges and preserve hamiltonicity in transforming these cycles to non-crossing Hamiltonian cycles.作者: endoscopy 時(shí)間: 2025-3-24 09:14
https://doi.org/10.1007/978-3-642-39010-4 all the .-sets of ., one can build the so called .-set polygon whose vertices are the centroids of the .-sets of .. In this paper, we extend the classical convex-hull divide and conquer construction method to build the .-set polygon.作者: commute 時(shí)間: 2025-3-24 14:10 作者: inhibit 時(shí)間: 2025-3-24 17:44 作者: Flavouring 時(shí)間: 2025-3-24 19:44 作者: 使聲音降低 時(shí)間: 2025-3-25 01:51
Transforming Graphs with the Same Degree Sequence,Let . and . be two graphs with the same vertex set .. It is well known that a graph . can be transformed into a graph . by a sequence of 2-switches if and only if every vertex of . has the same degree in both . and .. We study the problem of finding the minimum number of 2-switches for transforming . into ..作者: 共同時(shí)代 時(shí)間: 2025-3-25 06:42 作者: 松緊帶 時(shí)間: 2025-3-25 10:02
Coloring Axis-Parallel Rectangles,For every . and ., we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with . colors, there exists a point covered by precisely . members of the family, all of which have the same color. For .?=?2, this answers a question of S.?Smorodinsky?[S06].作者: 常到 時(shí)間: 2025-3-25 12:02 作者: armistice 時(shí)間: 2025-3-25 15:54
Deflating the Pentagon,lations, and that any infinite deflation sequence of a pentagon results from deflating an induced quadrilateral on four of the vertices. We describe a family of hexagons that deflate infinitely for a specific deflation sequence, yet induce no infinitely deflating quadrilateral. We also review the known understanding of quadrilateral deflation.作者: Conscientious 時(shí)間: 2025-3-25 23:53 作者: RALES 時(shí)間: 2025-3-26 03:08 作者: 先驅(qū) 時(shí)間: 2025-3-26 07:01 作者: 充氣球 時(shí)間: 2025-3-26 12:01
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets, and no element of . lies inside .. Let .(..,..,???,..) be the smallest integer such that any set of .(..,???,..) points contains a ..-hole for each ., 1?≤?.?≤?., where the holes are pairwise disjoint. We evaluate such values. In particular, we show that .(1,2,3,4,5)?=?15.作者: SSRIS 時(shí)間: 2025-3-26 13:17 作者: 苦澀 時(shí)間: 2025-3-26 19:43
Seven Types of Random Spherical Triangle in ,, and Their Probabilities,pherical triangles in .., and calculate the probabilities of seven types to which random spherical triangles belong. Each probability monotone converges to a certain value as the dimension . tends to infinity. As an application, we can estimate the expectation of numbers of division on acute triangulation of a random spherical triangle in ...作者: 急性 時(shí)間: 2025-3-26 22:13 作者: PATRI 時(shí)間: 2025-3-27 02:53
Divide and Conquer Method for ,-Set Polygons, all the .-sets of ., one can build the so called .-set polygon whose vertices are the centroids of the .-sets of .. In this paper, we extend the classical convex-hull divide and conquer construction method to build the .-set polygon.作者: nonradioactive 時(shí)間: 2025-3-27 09:20 作者: Antarctic 時(shí)間: 2025-3-27 10:22
978-3-540-89549-7Springer-Verlag Berlin Heidelberg 2008作者: 奇怪 時(shí)間: 2025-3-27 15:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232330.jpg作者: 蕁麻 時(shí)間: 2025-3-27 19:19 作者: 宮殿般 時(shí)間: 2025-3-27 22:15
Vissarion Papadopoulos,Dimitris G. Giovanisthat if . runs over the set of all graphs of order . and size ., then the values .(.) completely cover a line segment . of positive integers. Let . be the set of all graphs of order . and size . and . be the subset of . consisting of all connected graphs. We are able to obtain the extremal results for the forest number in the class . and ..作者: 盡責(zé) 時(shí)間: 2025-3-28 04:13 作者: ETCH 時(shí)間: 2025-3-28 08:35
https://doi.org/10.1007/978-1-4612-3094-6 can tile the plane using only rotations; these sets necessarily contain all such tiles that are fundamental domains for p4, p3, and p6 isohedral tilings. We display the outputs for small values of .. This expands on earlier work [3].作者: 與野獸博斗者 時(shí)間: 2025-3-28 10:37
Renata J. Romanowicz,Marzena Osuchf the state of vertex ., and each neighbor of ., from 0 to 1, or from 1 to 0. The given initial state of . is said to be . if a sequence of moves exists such that this state is transformed into the 0-state (all vertices have state 0.) If every initial state of . is solvable, we call . a .. We shall characterize here the solvable trees.作者: Dysarthria 時(shí)間: 2025-3-28 15:49 作者: 盡責(zé) 時(shí)間: 2025-3-28 22:31 作者: 他日關(guān)稅重重 時(shí)間: 2025-3-29 00:26 作者: 得意牛 時(shí)間: 2025-3-29 06:21
Stochastic Flood Forecasting Systempherical triangles in .., and calculate the probabilities of seven types to which random spherical triangles belong. Each probability monotone converges to a certain value as the dimension . tends to infinity. As an application, we can estimate the expectation of numbers of division on acute triangulation of a random spherical triangle in ...作者: Redundant 時(shí)間: 2025-3-29 09:18
Stochastic Foundations in Movement Ecologygive several results concerning the minimum number of operations that delete two crossing edges, add two other edges and preserve hamiltonicity in transforming these cycles to non-crossing Hamiltonian cycles.作者: ungainly 時(shí)間: 2025-3-29 14:49 作者: exceed 時(shí)間: 2025-3-29 17:01 作者: inferno 時(shí)間: 2025-3-29 21:01
Bartholdi Zeta Functions of Branched Coverings of Digraphs, for the Bartholdi zeta function of a branched covering of a digraph . which treated by Deng, Sato and Wu. As a corollary, we obtain a decomposition formula for the Bartholdi zeta function of a graph having a semi-free action.作者: 過(guò)濾 時(shí)間: 2025-3-30 03:42 作者: Alopecia-Areata 時(shí)間: 2025-3-30 08:02
Svetlana Borovkova,Ferry Jaya Permana. if the plane can be tiled by congruent copies of the polygon which are obtained without turning over the polygon. The numbers of types of convex tiles and convex normal tiles are still uncertain. In this paper, we prove that all convex normal tiles with the same area that we know so far are D-..作者: 鐵塔等 時(shí)間: 2025-3-30 11:01
E. Karamuz,R. J. Romanowicz,M. J. Booij polynomial time algorithm which given a graph either finds a skew partition or determines that no such partition exists. It runs in .(. .) time. We present an algorithm for the same problem which runs in .(. . .) time.作者: 整潔 時(shí)間: 2025-3-30 14:34
Dudeney Transformation of Normal Tiles,. if the plane can be tiled by congruent copies of the polygon which are obtained without turning over the polygon. The numbers of types of convex tiles and convex normal tiles are still uncertain. In this paper, we prove that all convex normal tiles with the same area that we know so far are D-..作者: 搬運(yùn)工 時(shí)間: 2025-3-30 18:05 作者: 定點(diǎn) 時(shí)間: 2025-3-30 23:16
Chromatic Numbers of Specified Isohedral Tilings, chromatic number is at most three. By using this fact, we prove that chromatic numbers of specified isohedral tilings with half-turn symmetry are at most three. Then, we notice that self-replicating tiles with fractal boundaries derived from developments of a doubly covered square, which we studied in [3,4], are three-colorable in a sense.作者: 注意力集中 時(shí)間: 2025-3-31 01:15 作者: Irrigate 時(shí)間: 2025-3-31 07:11 作者: 種子 時(shí)間: 2025-3-31 11:40
0302-9743 ks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.978-3-540-89549-7978-3-540-89550-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 指數(shù) 時(shí)間: 2025-3-31 14:27
Conference proceedings 2008pers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.作者: 石墨 時(shí)間: 2025-3-31 19:32 作者: Prognosis 時(shí)間: 2025-4-1 00:52
Stochastic Flows and Jump-Diffusionsand shows that every complete bipartite graph .. has a (3,2)-track subdivision of .. with 2 ?log.(..) ??+?1 division vertices per edge, where . and . are numbers of vertices of the partite sets of .. with .?≥?..作者: ANTH 時(shí)間: 2025-4-1 03:58 作者: 不能和解 時(shí)間: 2025-4-1 07:29
Conference proceedings 2008T 2007, held in Kyoto, Japan, in June 2007, in honor of Jin Akiyama and Va?ek Chvátal, on the occasion of their 60th birthdays. The 19 revised full papers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the 作者: Hiatal-Hernia 時(shí)間: 2025-4-1 12:36
Dudeney Transformation of Normal Tiles, (1?≤?.?≤?.???1). A polygon is called a . if the 2-dimensional Euclidean plane can be tiled by congruent copies of the polygon. A polygon is called a . if the plane can be tiled by congruent copies of the polygon which are obtained without turning over the polygon. The numbers of types of convex til
