標(biāo)題: Titlebook: WALCOM: Algorithms and Computation; 13th International C Gautam K. Das,Partha S. Mandal,Shin-ichi Nakano Conference proceedings 2019 Spring [打印本頁] 作者: Orthosis 時間: 2025-3-21 19:59
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱WALCOM: Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱WALCOM: Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱WALCOM: Algorithms and Computation被引頻次
書目名稱WALCOM: Algorithms and Computation被引頻次學(xué)科排名
書目名稱WALCOM: Algorithms and Computation年度引用
書目名稱WALCOM: Algorithms and Computation年度引用學(xué)科排名
書目名稱WALCOM: Algorithms and Computation讀者反饋
書目名稱WALCOM: Algorithms and Computation讀者反饋學(xué)科排名
作者: 男生如果明白 時間: 2025-3-21 23:27 作者: 擴(kuò)大 時間: 2025-3-22 01:58 作者: Abnormal 時間: 2025-3-22 05:10 作者: LEERY 時間: 2025-3-22 10:04 作者: 竊喜 時間: 2025-3-22 14:32 作者: Essential 時間: 2025-3-22 18:29 作者: 鑲嵌細(xì)工 時間: 2025-3-22 21:12
Hard and Easy Instances of L-Tromino Tilingsegions where only . rotations of L-trominoes are available. For this particular case we show that deciding the existence of a tiling remains NP-complete; yet, if a region does not contain so-called “forbidden polyominoes” as subregions, then there exists a polynomial time algorithm for deciding a tiling.作者: Flinch 時間: 2025-3-23 04:18 作者: NATAL 時間: 2025-3-23 06:39
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Componentssion for a class of graphs having a minimum resolving set with a bounded number of vertices in every extended biconnected component. Furthermore, we show that the decision problem . remains NP-complete when the above limitation is extended to usual biconnected components.作者: Arteriography 時間: 2025-3-23 13:00
Drawing Clustered Graphs on Disk Arrangementsster. This result can be seen as an extension of the result by Alam et al.?[.] who solely consider biconnected clusters. Moreover, we prove that it is .-hard to decide whether a clustered graph has such a straight-line drawing, if we permit pipe-disk intersections.作者: 陶醉 時間: 2025-3-23 16:58 作者: ABASH 時間: 2025-3-23 19:10 作者: 變異 時間: 2025-3-23 22:23 作者: Amendment 時間: 2025-3-24 06:00 作者: Pde5-Inhibitors 時間: 2025-3-24 08:09
(,,?,)-Planarity: A Relaxation of Hybrid Planarityarity testing and (2,?2)-planarity testing are NP-complete problems. Finally, we prove that neither the class of (2,?2)-planar graphs nor the class of 1-planar graphs contains the other, indicating that the (.,?.)-planar graphs are a large and novel class.作者: 去掉 時間: 2025-3-24 12:25
Graph Profile Realizations and Applications to Social Networkse satisfied with their social status. We study these criteria from the point of view of network realization: given a satisfaction specification, decide whether there exists a network realizing this specification.作者: 損壞 時間: 2025-3-24 15:52
Graph Profile Realizations and Applications to Social Networkse satisfied with their social status. We study these criteria from the point of view of network realization: given a satisfaction specification, decide whether there exists a network realizing this specification.作者: canvass 時間: 2025-3-24 19:35
A Linear Time Algorithm for the ,-Gathering Problem on the Line (Extended Abstract) .. The .-gathering problem computes the .-gathering minimizing the cost. In this paper we study the .-gathering problem when . and . are on a line and present a .-time algorithm to solve the problem. Our solution is optimal since any algorithm needs to read . and . at least once.作者: Humble 時間: 2025-3-25 02:29
Conference proceedings 2019topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering..作者: Ethics 時間: 2025-3-25 05:30 作者: Nostalgia 時間: 2025-3-25 10:30 作者: 精確 時間: 2025-3-25 12:51
Parameterized Computational Geometry via Decomposition Theoremse field largely focused on problems arising from studies of graphs and networks. However, lately the focus has changed substantially and it has started to permeate into other fields such as computational geometry, and computational social choice theory. In this article, we will survey some exciting 作者: 混合物 時間: 2025-3-25 19:37 作者: maintenance 時間: 2025-3-25 21:16
Topological Stability of Kinetic ,-centers cover . at every time step, such that the disks are as small as possible at any point in time. Whereas the optimal solution over time may exhibit discontinuous changes, many practical applications require the solution to be .: the disks must move smoothly over time. Existing results on this problem作者: 太空 時間: 2025-3-26 03:43
Graph Profile Realizations and Applications to Social Networksetween the individual and its neighbors. In this paper, we consider various criteria that measure social status and the extent in which individuals are satisfied with their social status. We study these criteria from the point of view of network realization: given a satisfaction specification, decid作者: Crohns-disease 時間: 2025-3-26 06:56
Maximum-Width Empty Square and Rectangular Annulusnulus of a certain shape with the maximum possible width that avoids a given set of . points in the plane. This problem can also be interpreted as the problem of finding an optimal location of a ring-shaped obnoxious facility among the input points. In this paper, we study square and rectangular var作者: Prognosis 時間: 2025-3-26 10:20 作者: 和藹 時間: 2025-3-26 13:47
Hard and Easy Instances of L-Tromino Tilingsitrary region in general is NP-complete, nonetheless, we identify restrictions to the problem where it either remains NP-complete or has a polynomial time algorithm. First, we characterize the possibility of when an Aztec rectangle has an L-tromino tiling, and hence also an Aztec diamond; if an Azte作者: beta-carotene 時間: 2025-3-26 18:26
-Gatherings on a Starter contains at least . points. The .-gather clustering problem asks to find an .-gather clustering which minimizes the maximum distance between any two points in a cluster. An .-gathering of . is an assignment of each customer . to a facility . such that each open facility has zero or at least . cu作者: 死貓他燒焦 時間: 2025-3-27 00:35 作者: 秘方藥 時間: 2025-3-27 02:28
Topological Stability of Kinetic ,-centers cover . at every time step, such that the disks are as small as possible at any point in time. Whereas the optimal solution over time may exhibit discontinuous changes, many practical applications require the solution to be .: the disks must move smoothly over time. Existing results on this problem作者: glacial 時間: 2025-3-27 08:39 作者: 不公開 時間: 2025-3-27 11:50 作者: 豐滿中國 時間: 2025-3-27 17:31 作者: GRATE 時間: 2025-3-27 18:49
Maximum-Width Empty Square and Rectangular Annulusnulus of a certain shape with the maximum possible width that avoids a given set of . points in the plane. This problem can also be interpreted as the problem of finding an optimal location of a ring-shaped obnoxious facility among the input points. In this paper, we study square and rectangular var作者: 脊椎動物 時間: 2025-3-27 22:30 作者: 地牢 時間: 2025-3-28 03:43 作者: 闡釋 時間: 2025-3-28 06:45 作者: constitutional 時間: 2025-3-28 11:04
Drawing Clustered Graphs on Disk Arrangementsith a bijection between the disks and the clusters. Akitaya et al.?[.] give an algorithm to test whether . can be embedded onto . with the additional constraint that edges are routed through a set of pipes between the disks. Based on such an embedding, we prove that every clustered graph and every d作者: 男學(xué)院 時間: 2025-3-28 17:23
The Prefix Fréchet Similarity) curves . and?., we ask for two . of . and?. which have a Fréchet distance no larger than a given distance threshold . w.r.t. . metric such that the sum of the prefix curves is maximal. As parameterized Fréchet measures as, e.g., the prefix Fréchet similarity are highly unstable w.r.t. to the value作者: browbeat 時間: 2025-3-28 20:22
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Componentsand the distance between . and . are different. The . of . is the size of a smallest resolving set for .. Deciding whether a given graph . has Metric Dimension at most . for some integer . is well-known to be NP-complete. A lot of research has been done to understand the complexity of this problem o作者: 返老還童 時間: 2025-3-28 23:49 作者: 懶惰民族 時間: 2025-3-29 06:08
Optimal Partition of a Tree with Social Distanceem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that . can be solved in linear time for trees. Moreover, we show that . is NP-hard even for 4-regular graphs.作者: V洗浴 時間: 2025-3-29 09:35 作者: 英寸 時間: 2025-3-29 11:45 作者: 值得 時間: 2025-3-29 18:54 作者: 撫育 時間: 2025-3-29 23:42
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Componentsand the distance between . and . are different. The . of . is the size of a smallest resolving set for .. Deciding whether a given graph . has Metric Dimension at most . for some integer . is well-known to be NP-complete. A lot of research has been done to understand the complexity of this problem o作者: 熱心助人 時間: 2025-3-30 00:32
Conference proceedings 2019 India, in February/ March 2019...The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; d作者: 變量 時間: 2025-3-30 04:37 作者: RADE 時間: 2025-3-30 10:41
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/w/image/1020028.jpg作者: 原告 時間: 2025-3-30 13:26
https://doi.org/10.1007/978-3-030-10564-8approximation algorithms; approximation algorithms analysis; cluster; clustering; computational geometry作者: Homocystinuria 時間: 2025-3-30 18:46 作者: 恭維 時間: 2025-3-30 23:06
WALCOM: Algorithms and Computation978-3-030-10564-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 獸皮 時間: 2025-3-31 01:30 作者: 靈敏 時間: 2025-3-31 08:29 作者: nautical 時間: 2025-3-31 09:48
. Selbst in neueren Arbeiten wird die Letalit?t mit 84% [15] bzw. 88% [22] angegeben. Angesichts der erheblich verbesserten therapeutischen M?glichkeiten der Intensivmedizin generell sowie der Nierenersatztherapie spiegelt sich in diesen ungünstigen Resultaten in erster Linie ein Wandel der demograp作者: corporate 時間: 2025-3-31 15:44 作者: 未完成 時間: 2025-3-31 19:15 作者: 脫水 時間: 2025-3-31 22:31 作者: 的’ 時間: 2025-4-1 02:14
esearch activities have concentrated on mechanisms and related aspects. Among these the following were the most important topics: hydrogen transfer and especially the question of concerted or multistep reaction; the influence of the structure on the selectivity of hydrogen migration . higher-membere作者: 領(lǐng)帶 時間: 2025-4-1 07:59 作者: Anterior 時間: 2025-4-1 10:21 作者: obligation 時間: 2025-4-1 15:01
cids as a key to the understanding of the nature of life is reflected in the enormous number of published works on the subject, including many outstanding monographs and surveys. The pathways of syn- thesis and metabolism of nucleic acid,s and the many and varied biological functions of these biopol作者: wall-stress 時間: 2025-4-1 20:24 作者: 壕溝 時間: 2025-4-2 01:15 作者: paradigm 時間: 2025-4-2 06:06
Shareef Ahmed,Shin-ichi Nakano,Md. Saidur Rahmans. A selection of techniques that can be applied to grow thin films and/or nanowires of molecule-based materials is described. These techniques can be divided in two categories: deposition using a gas phase reaction or a reaction in solution. Chemical vapor deposition (CVD) and evaporation under ult作者: 單片眼鏡 時間: 2025-4-2 09:18 作者: parsimony 時間: 2025-4-2 11:24
Ivor Hoog v.d.,Marc van Kreveld,Wouter Meulemans,Kevin Verbeek,Jules Wulmsic compounds. Particular attention is paid to the n-fatty acids, since numerous studies have recently been made on these compounds. Details of their molecular structures are described, based on X-ray crystallographic and vibrational spectroscopic data. Using stearic acid, an outstanding model substa作者: 責(zé)問 時間: 2025-4-2 17:30
Stefan Klootwijk,Bodo Manthey,Sander K. Visserskeletons are built up of carbon atoms. The remaining valences are connected with ligands such as hydrogen, halo- gens, -OH,==O, -NH . Some of the skeletal carbon atoms can be replaced by non- 2 metals such as oxygen, nitrogen, or sulfur {"heteroatoms"}. It is characteristic for the living world, no作者: organism 時間: 2025-4-2 19:37
Masahiro Okubo,Tesshu Hanaka,Hirotaka Ononot prepared until 1771, by K. W. Scheele, and elemental fluorine not until 1886, when H. Moissan subjected a solution of potassium fluoride in anhydrous hydrogen fluoride to electrolysis in a platinum apparatus. This delay is reflected in the chemistry of fluorine compounds. The early development o作者: GLOSS 時間: 2025-4-3 03:21
atom abstraction(1) their corresponding silanes are rather poor H-atom donors towards alkyl radicals and therefore not do support chain reactions except at elevated temperatures(2). Recently we found that the silicon-hydrogen bonds can be dramatically weakened by multiple substitution of Me.Si group作者: 嗎啡 時間: 2025-4-3 06:35
Sang Won Bae,Arpita Baral,Priya Ranjan Sinha Mahapatraximately 70 identified molecular species have been detected in interstellar molecular clouds and circumstellar shells. Identification of the newly detected species rests mainly on the exacting test between interstellar and laboratory spectra. A large number of unidentified interstellar lines indicat作者: 畫布 時間: 2025-4-3 11:27
Yiyang Jia,Yoshihiro Kanamori,Jun Mitani of early literature) it was only recently that active work has been done on these substances. . [3] seems to have been the first to identify mono-saccharides from Paleozoic and from pre-Cretaceous Mesozoic rocks (Table 1). In addition to several monosaccharides which he characterized chromatographi作者: 逃避責(zé)任 時間: 2025-4-3 12:53
