標(biāo)題: Titlebook: Algorithms and Computation; 24th International S Leizhen Cai,Siu-Wing Cheng,Tak-Wah Lam Conference proceedings 2013 Springer-Verlag Berlin [打印本頁] 作者: Harding 時間: 2025-3-21 17:25
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: 慢跑鞋 時間: 2025-3-21 21:40 作者: orthodox 時間: 2025-3-22 01:11 作者: 商業(yè)上 時間: 2025-3-22 05:33 作者: 驚惶 時間: 2025-3-22 09:53 作者: majestic 時間: 2025-3-22 14:40
Determinantal Complexities and Field Extensions. We also consider additive constant gaps: (1) there exists a quadratic polynomial .?∈??[., .], such that ..(.)?=?3 and .; (2) there exists a cubic polynomial .?∈??[., .] with a rational zero, such that ..(.)?=?4 and .. For additive constant gaps, geometric criteria are presented to decide when ..作者: inveigh 時間: 2025-3-22 19:33 作者: Yag-Capsulotomy 時間: 2025-3-22 22:39
On Determining Deep Holes of Generalized Reed-Solomon Codese classify deep holes completely for generalized Reed-Solomon codes .. (.,.), where . is a prime, .. Our techniques are built on the idea of deep hole trees, and several results concerning the Erd?s-Heilbronn conjecture.作者: metropolitan 時間: 2025-3-23 05:12
The Complexity of Finding a Large Subgraph under Anonymity Constraintsther graph classes (like threshold graphs), and thereby establish a sharp borderline between hard and easy cases of the problem. Finally we perform a parametrized analysis, and we concisely characterize combinations of natural parameters that allow FPT algorithms.作者: 鞏固 時間: 2025-3-23 09:06
Hardness and Algorithms for Variants of Line Graphs of Directed Graphs easy to recognize when the underlying graph is triangle-free. We also determine the complexity of the vertex coloring, the stable set and the facility location problem for triangle-free facility location graphs.作者: LVAD360 時間: 2025-3-23 10:04 作者: 貨物 時間: 2025-3-23 17:53
https://doi.org/10.1007/978-3-658-20813-4e classify deep holes completely for generalized Reed-Solomon codes .. (.,.), where . is a prime, .. Our techniques are built on the idea of deep hole trees, and several results concerning the Erd?s-Heilbronn conjecture.作者: 一大群 時間: 2025-3-23 21:02 作者: opalescence 時間: 2025-3-24 01:22
https://doi.org/10.1007/978-3-476-03437-3 easy to recognize when the underlying graph is triangle-free. We also determine the complexity of the vertex coloring, the stable set and the facility location problem for triangle-free facility location graphs.作者: ALT 時間: 2025-3-24 03:15 作者: 預(yù)知 時間: 2025-3-24 09:35 作者: 無能性 時間: 2025-3-24 13:47
Grundlagen und Theorie – eine Einführungrs are introduced. We show that the problem can be solved in quadratic time and space. Finally, we consider the on-line version of the problem. We introduce a novel signature for palindromes and show that it has a pleasing behavior, similar to the Karp-Rabin signature. It allows solving the . problem on-line in linear time w.h.p.作者: 獨裁政府 時間: 2025-3-24 15:14 作者: 使成核 時間: 2025-3-24 19:33 作者: Myofibrils 時間: 2025-3-25 01:01 作者: Confidential 時間: 2025-3-25 04:10
Geodesic-Preserving Polygon Simplificationons of numerous problems on polygons (including shortest paths, geodesic hulls, separating point sets, and Voronoi diagrams) are equivalent for both . and ., our algorithm can be used as a preprocessing step for several algorithms and makes their running time dependent on the number of reflex vertices rather than on the size of?..作者: Observe 時間: 2025-3-25 11:11 作者: 一瞥 時間: 2025-3-25 13:54
Beating , in Approximate LZW-Compressed Pattern Matchingriodicity-based argument in a way that is computationally effective even if we operate on a compressed representation of a string, while the previous solutions were either based on a dynamic programming, or a black-box application of tools developed for uncompressed strings.作者: 老巫婆 時間: 2025-3-25 18:49 作者: hegemony 時間: 2025-3-25 21:41 作者: 細(xì)胞學(xué) 時間: 2025-3-26 00:27 作者: Nmda-Receptor 時間: 2025-3-26 06:36
Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle InformatiWe propose a linear working space algorithm for reconstructing a simple polygon from the visibility angle information at vertices up to similarity. We also modify the algorithm such that its running time is sensitive to the size of visibility graph and also the diameter of a triangulation of the polygon.作者: Cerumen 時間: 2025-3-26 11:31 作者: 符合規(guī)定 時間: 2025-3-26 12:42
Algorithms and Computation978-3-642-45030-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 含糊其辭 時間: 2025-3-26 17:42 作者: 責(zé)任 時間: 2025-3-27 00:36 作者: 釋放 時間: 2025-3-27 04:23 作者: diabetes 時間: 2025-3-27 07:57 作者: fatty-streak 時間: 2025-3-27 11:50 作者: Absenteeism 時間: 2025-3-27 13:56
Leizhen Cai,Siu-Wing Cheng,Tak-Wah LamUp-to-date results Proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013作者: 豐富 時間: 2025-3-27 18:58 作者: pericardium 時間: 2025-3-27 23:55 作者: 受傷 時間: 2025-3-28 05:28
Der Mensch als Mitte und Ma?stab der Medizinepends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve is often related to the reflex vertices of the polygon. In this paper, we give an easy-to-describe linear-time method to replace an input polygon?. by a polygon?. such that (1)?. contains?., (2)?作者: 助記 時間: 2025-3-28 07:27
Der Mensch als Mitte und Ma?stab der MedizinEuclidean minimum-weight Laman graph and proximity graphs, and then we show that the Euclidean minimum-weight Laman graph is quasi-planar and 6-planar. Thus the crossing number of the Euclidean minimum-weight Laman graph is linear in the number of points.作者: amorphous 時間: 2025-3-28 13:06
Grundlagen und Theorie – eine Einführungonsider .. Since this is a generalization of the Sorting by Reversals problem, it is clearly .-hard. We, therefore consider the simplification where reversals cannot overlap. Such a constrained version has been researched in the past for various metrics in the rearrangement model - the swap metric a作者: 疲憊的老馬 時間: 2025-3-28 16:34 作者: AV-node 時間: 2025-3-28 19:19 作者: progestin 時間: 2025-3-29 00:14 作者: 性滿足 時間: 2025-3-29 05:04
https://doi.org/10.1007/978-3-658-20813-4 received word is a deep hole for generalized Reed-Solomon codes is proved to be co-NP-complete [9][5]. For the extended Reed-Solomon codes ., a conjecture was made to classify deep holes in [5]. Since then a lot of effort has been made to prove the conjecture, or its various forms. In this paper, w作者: Accord 時間: 2025-3-29 11:10
Risiken – eine Frage der Toleranzthe set of forbidden subgraphs is finite. More precisely, we show that the problem is polynomial-time solvable if the forbidden set contains a forest of subdivided stars and is graph isomorphism complete otherwise. We also show that, assuming that the graph isomorphism problem is not polynomial-time作者: 凝結(jié)劑 時間: 2025-3-29 13:35
Social Engineering als Modus Operandi..’s over ., such that . as polynomials in .. To determine the determinantal complexity of the permanent polynomial is a long-standing open problem..Let . be an . of .; then . can be viewed as a polynomial over .. We are interested in the comparison between the determinantal complexity of . over . (作者: 考古學(xué) 時間: 2025-3-29 18:31
Social Engineering als Modus Operandiir attributes or opinions are similar. In the model, a .-dimensional vector a. represents the extent to which individual . has each of a set of . attributes or opinions. Then two individuals . and . are assumed to be friends, that is, they are connected in the graph model, if and only if a. · a.?≥?.作者: Freeze 時間: 2025-3-29 22:37
https://doi.org/10.1007/978-3-658-20813-4. in .. We consider graphs of bounded degree and develop a sublinear-time algorithm for estimating log.(.,.) at an arbitrary value .?>?0 within additive error . with high probability. The query complexity of our algorithm does not depend on the size of . and is polynomial in 1/., and we also provide作者: Directed 時間: 2025-3-30 02:11
https://doi.org/10.1007/978-3-322-88506-7emove a small number of vertices from the graph such that in the resulting subgraph every occurring vertex degree occurs many times..We prove that the problem is NP-hard for trees, and also for a number of other highly structured graph classes. Furthermore we provide polynomial time algorithms for o作者: conifer 時間: 2025-3-30 06:46
Der Mensch als St?rfaktor im Geosystem. and .. We prove a tight bound of 4.???9 on the maximum number of edges of such a graph for a straight-edge drawing. The bound is 4.???8 if the edges are Jordan curves. We also discuss generalizations to monotone graph properties.作者: 公理 時間: 2025-3-30 10:52 作者: 教唆 時間: 2025-3-30 14:22 作者: intrude 時間: 2025-3-30 19:34
https://doi.org/10.1007/978-3-476-03437-3nt if their corresponding arcs share a common node that is the tail of at least one of these arcs. We call them facility location graphs since they arise from the classical uncapacitated facility location problem. In this paper we show that facility location graphs are hard to recognize but they are作者: Confirm 時間: 2025-3-30 21:21 作者: Conclave 時間: 2025-3-31 04:40
On the Number of Edges of Fan-Crossing Free Graphs. and .. We prove a tight bound of 4.???9 on the maximum number of edges of such a graph for a straight-edge drawing. The bound is 4.???8 if the edges are Jordan curves. We also discuss generalizations to monotone graph properties.作者: blight 時間: 2025-3-31 05:09 作者: 勤勉 時間: 2025-3-31 13:12
Market Approach to Social Ads: The MyLikes Example and Related Problemse an example: MyLikes, which is a new advertising platform. It lets anyone on a social network be a “publisher” of advertisements (ads). It provides a matching market so advertisers can find social publishers to advertise their products. Further, interestingly, it lets the social publishers modify t作者: 口味 時間: 2025-3-31 14:36
Geodesic-Preserving Polygon Simplificationepends on the size of the input polygon, the intrinsic complexity of the problems these algorithms solve is often related to the reflex vertices of the polygon. In this paper, we give an easy-to-describe linear-time method to replace an input polygon?. by a polygon?. such that (1)?. contains?., (2)?作者: Handedness 時間: 2025-3-31 19:17
On the Edge Crossing Properties of Euclidean Minimum Weight Laman GraphsEuclidean minimum-weight Laman graph and proximity graphs, and then we show that the Euclidean minimum-weight Laman graph is quasi-planar and 6-planar. Thus the crossing number of the Euclidean minimum-weight Laman graph is linear in the number of points.作者: Commentary 時間: 2025-4-1 00:49 作者: certitude 時間: 2025-4-1 02:31 作者: 貿(mào)易 時間: 2025-4-1 09:51
Beating , in Approximate LZW-Compressed Pattern Matchingpending on the size . of the compressed representation of the text instead of its length. We consider two specific definitions of approximate matching, namely the Hamming distance and the edit distance, and show how to achieve . and . running time, respectively, where . is the bound on the distance,作者: 原告 時間: 2025-4-1 12:56
Less Space: Indexing for Queries with Wildcards...] comes as a query, we can efficiently report all those locations where . occurs as a substring of .. In this paper, we consider the case when . contains wildcard characters (which can match with any other character). The first non-trivial solution for the problem is given by Cole et al. [STOC 20作者: 魅力 時間: 2025-4-1 16:15 作者: 妨礙議事 時間: 2025-4-1 21:41
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classesthe set of forbidden subgraphs is finite. More precisely, we show that the problem is polynomial-time solvable if the forbidden set contains a forest of subdivided stars and is graph isomorphism complete otherwise. We also show that, assuming that the graph isomorphism problem is not polynomial-time作者: Addictive 時間: 2025-4-1 23:57 作者: 委屈 時間: 2025-4-2 04:10
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphsir attributes or opinions are similar. In the model, a .-dimensional vector a. represents the extent to which individual . has each of a set of . attributes or opinions. Then two individuals . and . are assumed to be friends, that is, they are connected in the graph model, if and only if a. · a.?≥?.作者: Absenteeism 時間: 2025-4-2 06:59 作者: hysterectomy 時間: 2025-4-2 12:00
