標題: Titlebook: Computing and Combinatorics; 6th Annual Internati Ding-Zhu Du,Peter Eades,Arun Sharma Conference proceedings 2000 Springer-Verlag Berlin He [打印本頁] 作者: 指責(zé) 時間: 2025-3-21 18:45
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學(xué)科排名
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學(xué)科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學(xué)科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學(xué)科排名
作者: 燕麥 時間: 2025-3-21 21:01
https://doi.org/10.1007/978-3-8348-9482-3r factorisation algorithms, consider their suitability for implementation on parallel machines, and give examples of their current capabilities. In particular, we consider the problem of parallel solution of the large, sparse linear systems which arise with the MPQS and NFS methods.作者: 褪色 時間: 2025-3-22 03:41 作者: AUGER 時間: 2025-3-22 07:23 作者: Forage飼料 時間: 2025-3-22 08:46
Recent Progress and Prospects for Integer Factorisation Algorithmsr factorisation algorithms, consider their suitability for implementation on parallel machines, and give examples of their current capabilities. In particular, we consider the problem of parallel solution of the large, sparse linear systems which arise with the MPQS and NFS methods.作者: wall-stress 時間: 2025-3-22 16:41 作者: wall-stress 時間: 2025-3-22 20:08
,?quivalenz von W?rme und Arbeit,ce; 3) both constant search time and linear space usage can be attained if the (memoryless) source is symmetric. We accompany our analysis with a brief survey of several known types of adaptive trie structures, and show how our analysis extends (and/or complements) the previous results.作者: 背信 時間: 2025-3-22 21:17 作者: Water-Brash 時間: 2025-3-23 04:41
Some Results on Tries with Adaptive Branchingce; 3) both constant search time and linear space usage can be attained if the (memoryless) source is symmetric. We accompany our analysis with a brief survey of several known types of adaptive trie structures, and show how our analysis extends (and/or complements) the previous results.作者: MUMP 時間: 2025-3-23 07:42 作者: 開始發(fā)作 時間: 2025-3-23 10:39
Embedding Problems for Paths with Direction Constrained Edgescts the directions assigned to its edges. This problem arises in the context of extending planar graph embedding techniques and VLSI rectilinear layout techniques from 2. to 3.. We give combinatorial characterizations of reachability that yield linear time recognition and layout algorithms.作者: BLANC 時間: 2025-3-23 16:10
Rectangular Drawings of Plane Graphs Without Designated Corners a necessary and sufficient condition for the existence of a rectangular drawing of . for the general case in which no vertices are designated as corners. We also give a linear-time algorithm to find a rectangular drawing of . if it exists.作者: vibrant 時間: 2025-3-23 19:01
Approximation Algorithms for Independent Sets in Map Graphsiven a weight, while a ratio of .(log .) can be achieved in .(.. log .) time otherwise. Behind the design of our algorithms are several fundamental results for map graphs; these results can be used to design good approximation algorithms for coloring and vertex cover in map graphs, and may find applications to other problems on map graphs as well.作者: 驚惶 時間: 2025-3-24 00:22
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphsifferent approach for finding the minimum cardinality connected dominating set in trapezoid graphs using . time. For finding the minimum weighted connected dominating set, we show the problem can be efficiently solved in .(. log log .) time.作者: diabetes 時間: 2025-3-24 04:42
Parameterized Complexity of Finding Subgraphs with Hereditary Propertiese parameterized class W[1] and is fixed parameter tractable otherwise. In the former case, if the forbidden set of the property is finite, we show, in fact, that the problem is W[1]-complete (see [.] for definitions). Our proofs, both of the tractability as well as the hardness ones, involve clever use of Ramsey numbers.作者: Malleable 時間: 2025-3-24 08:11
Closure Properties of Real Number Classes under Limits and Computable Operatorseakly computable real numbers is not closed under effective limit and partial computable functions while the class of recursively approximable real numbers is closed under effective limit and partial computable functions.作者: 座右銘 時間: 2025-3-24 14:01 作者: disciplined 時間: 2025-3-24 15:07
Hierarchical Topological Inference on Planar Disc Mapsvery (.) ∈?., and (3) . includes . as a sub-region for every (.) ∈?.. This problem arises from the study in geographic information systems. The problem is in NP but not known to be NP-hard or polynomial-time solvable. This paper shows that a nontrivial special case of the problem can be solved in almost linear time.作者: Perceive 時間: 2025-3-24 21:48 作者: 雜色 時間: 2025-3-25 02:38 作者: Somber 時間: 2025-3-25 04:11
Die Systeme und ihre Beschreibung,iven a weight, while a ratio of .(log .) can be achieved in .(.. log .) time otherwise. Behind the design of our algorithms are several fundamental results for map graphs; these results can be used to design good approximation algorithms for coloring and vertex cover in map graphs, and may find applications to other problems on map graphs as well.作者: nutrients 時間: 2025-3-25 10:31 作者: 有抱負者 時間: 2025-3-25 15:12
Der zweite Hauptsatz der Thermodynamik,e parameterized class W[1] and is fixed parameter tractable otherwise. In the former case, if the forbidden set of the property is finite, we show, in fact, that the problem is W[1]-complete (see [.] for definitions). Our proofs, both of the tractability as well as the hardness ones, involve clever use of Ramsey numbers.作者: 肌肉 時間: 2025-3-25 16:37 作者: Liability 時間: 2025-3-25 21:13
Die Systeme und ihre Beschreibung,In this paper we show a duality between extreme (small) face problems in line arrangements (bounded in the unit square) and Heilbronn-type problems. We obtain lower and upper combinatorial bounds (some are tight) for some of these problems.作者: 冷峻 時間: 2025-3-26 02:01 作者: liaison 時間: 2025-3-26 07:24
Ding-Zhu Du,Peter Eades,Arun SharmaIncludes supplementary material: 作者: CURT 時間: 2025-3-26 08:56
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234778.jpg作者: 破譯 時間: 2025-3-26 13:22
https://doi.org/10.1007/3-540-44968-XAutomat; algorithms; automata; combinatorial optimization; combinatorics; complexity; computational geomet作者: 傲慢人 時間: 2025-3-26 17:04 作者: 泛濫 時間: 2025-3-26 23:50
Approximating Uniform Triangular Meshes in Polygonsr of . using . Steiner points. More specifically, we want to find both a set .. of . points inside ., and a triangulation of . using .., with respect to the following minimization criteria: (1) ratio of the maximum edge length to the minimum one, (2) maximum edge length, and (3) maximum triangle perimeter.作者: 享樂主義者 時間: 2025-3-27 01:55 作者: 苦惱 時間: 2025-3-27 08:33 作者: 云狀 時間: 2025-3-27 12:42 作者: Relinquish 時間: 2025-3-27 16:42
Peter Jany,Gern Thieleke,Klaus Langeheineckece of a new generation of foundational problems for Theoretical Computer Science. These new theoretical challenges emanate from several novel aspects of the Internet: (a) Its unprecedented size, diversity, and availability as an information repository; (b) its novel nature as a computer system that 作者: canvass 時間: 2025-3-27 21:10
https://doi.org/10.1007/978-3-8348-9482-3security depends on the presumed difficulty of solving these problems. This paper considers primarily the integer factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in part to Moore’s law and in part to algorithmic improveme作者: invade 時間: 2025-3-28 00:50 作者: PLUMP 時間: 2025-3-28 04:45 作者: CALL 時間: 2025-3-28 06:32
Die Systeme und ihre Beschreibung,cal bounds on the size of these features are also of great interest. Heilbronn’s triangle problem is one of the famous problems in discrete geometry. In this paper we show a duality between extreme (small) face problems in line arrangements (bounded in the unit square) and Heilbronn-type problems. W作者: seduce 時間: 2025-3-28 11:40 作者: 招待 時間: 2025-3-28 17:25
Ideale Gas- und Gas-Dampf-Gemische, a desired direction (East, West, North, South, Up, or Down) but no length. We ask which points of .. can be reached by the terminus of an embedding of such a path, by choosing appropriate positive lengths for the edges, if the embedded path starts at the origin, does not intersect itself, and respe作者: 無畏 時間: 2025-3-28 20:42 作者: 蝕刻術(shù) 時間: 2025-3-29 00:12
Zustandsgleichungen Idealer Gase, line segment, and the contour of each face is drawn as a rectangle. A necessary and sufficient condition for the existence of a rectangular drawing has been known only for the case where exactly four vertices of degree 2 are designated as corners in a given plane graph .. In this paper we establish作者: 現(xiàn)任者 時間: 2025-3-29 03:48 作者: Archipelago 時間: 2025-3-29 08:13
Die Systeme und ihre Beschreibung,hout weights on its vertices. If . is given together with a map, then a ratio of 1+δ can be achieved in .(..) time for any given constant . > 0, no matter whether each vertex of . is given a weight or not. In case . is given without a map, a ratio of 4 can be achieved in .(..) time if no vertex is g作者: 易發(fā)怒 時間: 2025-3-29 11:27 作者: isotope 時間: 2025-3-29 18:04
Zustandsgleichungen Idealer Gase, results is recently improved to be . time by Kohler [.]. For the (vertex) weighted case, finding the minimum weighted connected dominating set in trapezoid graphs can be solved in . log .) time [.]. Here . (.) denotes the number of vertices (edges) of the trapezoid graph..In this paper, we show a d作者: monochromatic 時間: 2025-3-29 22:28 作者: Anticoagulants 時間: 2025-3-30 00:08 作者: Fissure 時間: 2025-3-30 06:25 作者: 多節(jié) 時間: 2025-3-30 10:50 作者: 龍卷風(fēng) 時間: 2025-3-30 13:58 作者: NEG 時間: 2025-3-30 20:20 作者: Inferior 時間: 2025-3-30 20:50
Computing and Combinatorics978-3-540-44968-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Hemodialysis 時間: 2025-3-31 01:23 作者: Lipohypertrophy 時間: 2025-3-31 05:20 作者: Archipelago 時間: 2025-3-31 11:48
Ideale Gas- und Gas-Dampf-Gemische,random greedy algorithm, on random cubic graphs using differential equations and obtain a lower bound on the expected size of the induced matching returned by the algorithm. The corresponding upper bound is derived by means of a direct expectation argument. We prove that . asymptotically almost surely satisfies 0:2704n < |.| < 0:2821..作者: 字的誤用 時間: 2025-3-31 14:55 作者: 一再煩擾 時間: 2025-3-31 18:43
Der zweite Hauptsatz der Thermodynamik,the search space of graphs and how to simplify the process for deciding whether a graph is an obstruction for .-V. Cover. The upper bounds . + 1 (. + 2) on the maximum number of vertices for connected (disconnected) obstructions are shown to be sharp for all . > 0.作者: 柔軟 時間: 2025-3-31 22:17 作者: Duodenitis 時間: 2025-4-1 02:03 作者: Adenocarcinoma 時間: 2025-4-1 09:51
Computing Optimal Embeddings for Planar Graphsenchmark graphs show that we are able to solve the problem for graphs with 100 vertices in less than one second and that the necessary data structures for the optimization can be build in less than 12 seconds.作者: 失望昨天 時間: 2025-4-1 10:19
Optimal Coding with One Asymmetric Error: Below the Sphere Packing Boundng attention on the case . = 1; in this self-contained paper we shall give tight upper and lower bounds for the half-lie problem. For infinitely many .’s our bounds turn out to be matching, and the optimal solution is explicitly given, thus strengthening previous estimates by Rivest, Meyer et al.作者: 贊美者 時間: 2025-4-1 17:47
Theoretical Problems Related to the Internetce of a new generation of foundational problems for Theoretical Computer Science. These new theoretical challenges emanate from several novel aspects of the Internet: (a) Its unprecedented size, diversity, and availability as an information repository; (b) its novel nature as a computer system that 作者: figure 時間: 2025-4-1 21:26
Recent Progress and Prospects for Integer Factorisation Algorithmssecurity depends on the presumed difficulty of solving these problems. This paper considers primarily the integer factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in part to Moore’s law and in part to algorithmic improveme作者: 殘酷的地方 時間: 2025-4-2 01:01
Approximating Uniform Triangular Meshes in Polygonsr of . using . Steiner points. More specifically, we want to find both a set .. of . points inside ., and a triangulation of . using .., with respect to the following minimization criteria: (1) ratio of the maximum edge length to the minimum one, (2) maximum edge length, and (3) maximum triangle per作者: 空洞 時間: 2025-4-2 02:57 作者: esoteric 時間: 2025-4-2 10:27
