標(biāo)題: Titlebook: Discrete and Computational Geometry, Graphs, and Games; 21st Japanese Confer Jin Akiyama,Reginaldo M. Marcelo,Yushi Uno Conference proceedi [打印本頁(yè)] 作者: 正當(dāng)理由 時(shí)間: 2025-3-21 19:25
書目名稱Discrete and Computational Geometry, Graphs, and Games影響因子(影響力)
書目名稱Discrete and Computational Geometry, Graphs, and Games影響因子(影響力)學(xué)科排名
書目名稱Discrete and Computational Geometry, Graphs, and Games網(wǎng)絡(luò)公開度
書目名稱Discrete and Computational Geometry, Graphs, and Games網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete and Computational Geometry, Graphs, and Games被引頻次
書目名稱Discrete and Computational Geometry, Graphs, and Games被引頻次學(xué)科排名
書目名稱Discrete and Computational Geometry, Graphs, and Games年度引用
書目名稱Discrete and Computational Geometry, Graphs, and Games年度引用學(xué)科排名
書目名稱Discrete and Computational Geometry, Graphs, and Games讀者反饋
書目名稱Discrete and Computational Geometry, Graphs, and Games讀者反饋學(xué)科排名
作者: dagger 時(shí)間: 2025-3-21 23:02 作者: 不舒服 時(shí)間: 2025-3-22 01:33 作者: 行為 時(shí)間: 2025-3-22 05:13
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.作者: 兩棲動(dòng)物 時(shí)間: 2025-3-22 12:32
,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.作者: 斑駁 時(shí)間: 2025-3-22 15:17 作者: 斑駁 時(shí)間: 2025-3-22 20:15
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 作者: 相互影響 時(shí)間: 2025-3-22 21:39 作者: deficiency 時(shí)間: 2025-3-23 02:54 作者: 莎草 時(shí)間: 2025-3-23 06:19 作者: 膽小懦夫 時(shí)間: 2025-3-23 12:34
https://doi.org/10.1007/978-1-4615-0603-4 of reactions with the same reactant complex are identical. As illustration, we considered a scenario in the pre-industrial state of global carbon cycle. A power-law approximation of the dynamical system of this scenario is found to be dynamically equivalent to an ACR-possessing PL-RDK system.作者: cravat 時(shí)間: 2025-3-23 15:03 作者: motivate 時(shí)間: 2025-3-23 21:01
Robustness in Power-Law Kinetic Systems with Reactant-Determined Interactions, of reactions with the same reactant complex are identical. As illustration, we considered a scenario in the pre-industrial state of global carbon cycle. A power-law approximation of the dynamical system of this scenario is found to be dynamically equivalent to an ACR-possessing PL-RDK system.作者: 外貌 時(shí)間: 2025-3-24 02:13
0302-9743 etry and Graphs, JCDCGGG 2018, held in Quezon City, Philippines, in September 2018.. The total of 14 papers included in this volume was carefully reviewed and selected from 25 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new作者: Terminal 時(shí)間: 2025-3-24 04:28 作者: Incisor 時(shí)間: 2025-3-24 10:32
https://doi.org/10.1007/978-3-642-21308-3ni 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.作者: configuration 時(shí)間: 2025-3-24 13:08 作者: EVEN 時(shí)間: 2025-3-24 18:47 作者: upstart 時(shí)間: 2025-3-24 21:58 作者: Repetitions 時(shí)間: 2025-3-25 01:03 作者: Ethics 時(shí)間: 2025-3-25 07:14 作者: Negligible 時(shí)間: 2025-3-25 09:48 作者: 大罵 時(shí)間: 2025-3-25 15:14 作者: 前奏曲 時(shí)間: 2025-3-25 17:40 作者: 手勢(shì) 時(shí)間: 2025-3-25 21:10
https://doi.org/10.1007/978-1-349-20698-8nian paths and spanning trees with certain conditions) properties. Toughness and scattering number conditions are necessary conditions for graphs to have such properties. Since every .-connected graph on a surface . satisfies some toughness and scattering number condition, we can expect that “every 作者: Creatinine-Test 時(shí)間: 2025-3-26 03:50 作者: 吞噬 時(shí)間: 2025-3-26 05:57
https://doi.org/10.1007/978-1-4615-0603-4derlying components of a system that give rise to robustness is often elusive. The influential work of Shinar and Feinberg established simple yet subtle network-based conditions for absolute concentration robustness (ACR), a phenomenon in which a species in a mass-action system has the same concentr作者: recede 時(shí)間: 2025-3-26 09:26 作者: Phonophobia 時(shí)間: 2025-3-26 16:28
Survey of Semiconductor Physicsigami invariant under a plane crystallographic group is called a .. An .-. is a tiling consisting of regular polygons, with the property that its vertices form . transitivity classes under the action of its symmetry group.作者: CIS 時(shí)間: 2025-3-26 17:46
Discrete and Computational Geometry, Graphs, and Games978-3-030-90048-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 殖民地 時(shí)間: 2025-3-26 21:58 作者: FLIC 時(shí)間: 2025-3-27 01:46
Surveilling and Securing the OlympicsA finite set of vectors . in the .-dimensional Euclidean space . is called a 2-distance set, if the set of mutual distances between distinct elements of . has cardinality exactly 2. In this note we report, among other things, the results of a computer-aided enumeration of the 2-distance sets in ..作者: In-Situ 時(shí)間: 2025-3-27 09:03
Immacolata Di Napoli,Caterina ArcidiaconoIn this paper, global locating-dominating sets of the join and Cartesian product of graphs are characterized. Global location-domination numbers and bounds of these graphs and some special graphs are determined. The relationship between the location-domination numbers of the join of two graphs and its complement is also shown.作者: Diaphragm 時(shí)間: 2025-3-27 09:41 作者: 散開 時(shí)間: 2025-3-27 17:08 作者: BLA 時(shí)間: 2025-3-27 21:44
https://doi.org/10.1007/978-1-4757-4305-0Kurotto and Juosan are Nikoli’s pencil puzzles. We study the computational complexity of Kurotto and Juosan puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete. Each of the two proofs uses a reduction from the PLANAR?3SAT problem.作者: 合適 時(shí)間: 2025-3-28 01:31
The Two-Distance Sets in Dimension Four,A finite set of vectors . in the .-dimensional Euclidean space . is called a 2-distance set, if the set of mutual distances between distinct elements of . has cardinality exactly 2. In this note we report, among other things, the results of a computer-aided enumeration of the 2-distance sets in ..作者: 無(wú)禮回復(fù) 時(shí)間: 2025-3-28 02:07
Global Location-Domination in the Join and Cartesian Product of Graphs,In this paper, global locating-dominating sets of the join and Cartesian product of graphs are characterized. Global location-domination numbers and bounds of these graphs and some special graphs are determined. The relationship between the location-domination numbers of the join of two graphs and its complement is also shown.作者: addition 時(shí)間: 2025-3-28 10:01
,Packing Cube Nets into Rectangles with?,(1) Holes,We show that the 11 hexomino nets of the unit cube (using arbitrarily many copies of each) can pack disjointly into an . rectangle and cover all but a constant . number of unit squares, where . for . integers .. On the other hand, the nets of the dicube (two unit cubes) can be exactly packed into some rectangles.作者: 不來(lái) 時(shí)間: 2025-3-28 10:50 作者: HAWK 時(shí)間: 2025-3-28 18:20 作者: 暫時(shí)過來(lái) 時(shí)間: 2025-3-28 18:55
https://doi.org/10.1007/978-3-030-90048-9communication systems; computer hardware; computer networks; computer science; computer systems; computer作者: IST 時(shí)間: 2025-3-28 22:54 作者: 闖入 時(shí)間: 2025-3-29 04:18 作者: Malaise 時(shí)間: 2025-3-29 09:58 作者: 相信 時(shí)間: 2025-3-29 12:59 作者: Leisureliness 時(shí)間: 2025-3-29 15:37
,On Geometric Graphs on Point Sets in?the Plane,er we survey several results on geometric graphs on colored point sets. Of particular interest are bicolored point sets . in which the elements of . can considered to be colored red or blue. We will pay particular attention to perfect matchings, spanning trees and paths whose vertex sets are colored作者: antiandrogen 時(shí)間: 2025-3-29 19:48
Negative Instance for the Edge Patrolling Beacon Problem,and the ball is a point always moving instantaneously and maximally toward the beacon subject to staying nonstrictly within the same polygon? Kouhestani and Rappaport [JCDCG 2017] gave an algorithm for determining whether a ball-capturing beacon strategy exists, while conjecturing that such a strate作者: Keshan-disease 時(shí)間: 2025-3-30 00:16
,The Metric Dimension of the Join of?Paths and Cycles,ere . is the distance of the vertices . and . in .. The set . is called a resolving set of . if . implies .. A resolving set of . with minimum cardinality is called a metric basis of .. The metric dimension of ., denoted by ., is the cardinality of a metric basis of ...The . of . and ., denoted by .作者: Debate 時(shí)間: 2025-3-30 07:42 作者: GEN 時(shí)間: 2025-3-30 10:15 作者: EVADE 時(shí)間: 2025-3-30 15:43 作者: 微塵 時(shí)間: 2025-3-30 19:01
Robustness in Power-Law Kinetic Systems with Reactant-Determined Interactions,derlying components of a system that give rise to robustness is often elusive. The influential work of Shinar and Feinberg established simple yet subtle network-based conditions for absolute concentration robustness (ACR), a phenomenon in which a species in a mass-action system has the same concentr作者: paragon 時(shí)間: 2025-3-30 23:23 作者: NADIR 時(shí)間: 2025-3-31 02:05
