標(biāo)題: Titlebook: Computing and Combinatorics; 16th Annual Internat My T. Thai,Sartaj Sahni Conference proceedings 2010 Springer-Verlag Berlin Heidelberg 201 [打印本頁(yè)] 作者: 閘門 時(shí)間: 2025-3-21 19:17
書目名稱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é)科排名
作者: famine 時(shí)間: 2025-3-21 20:16 作者: 上釉彩 時(shí)間: 2025-3-22 03:10
Boxicity and Poset Dimension,..]×[..,..]×???×[..,..]. The . of ., box(.) is the minimum integer . such that . can be represented as the intersection graph of .-dimensional boxes, i.e. each vertex is mapped to a .-dimensional box and two vertices are adjacent in . if and only if their corresponding boxes intersect. Let . be a p作者: 連詞 時(shí)間: 2025-3-22 07:18
On the Hardness against Constant-Depth Linear-Size Circuitsation, as there are general derandomization results which are based on the assumption that average-case hard functions exist. However, to achieve a complete derandomization, one usually needs a function which is extremely hard against a complexity class, in the sense that any algorithm in the class 作者: jovial 時(shí)間: 2025-3-22 11:14 作者: 繞著哥哥問 時(shí)間: 2025-3-22 16:25
The Curse of Connectivity: ,-Total Vertex (Edge) Coverly .-. and .-.. Specifically, we impose the additional requirement that each connected component of a solution have at least . vertices (resp. edges from the solution), and call the problem .-. (resp. .-.). We show that作者: 繞著哥哥問 時(shí)間: 2025-3-22 19:21 作者: 強(qiáng)制令 時(shí)間: 2025-3-22 22:53 作者: 結(jié)構(gòu) 時(shí)間: 2025-3-23 05:13 作者: 咯咯笑 時(shí)間: 2025-3-23 09:05
Clustering with or without the Approximationollow-up papers. The input for the clustering problem consists of points in a metric space and a number ., specifying the desired number of clusters. The algorithms find a clustering that is provably close to a target clustering, provided that the instance has the “( 1?+?., .)-property”, which means作者: Antigen 時(shí)間: 2025-3-23 13:24 作者: Jargon 時(shí)間: 2025-3-23 15:36 作者: 可觸知 時(shí)間: 2025-3-23 19:49
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphsithm with round complexity .(Δ), where Δ is the maximal degree of ., improving the previous 3-approximation result with the same round complexity .(Δ). For the weighted case, we give a 4-approximation algorithm with round complexity .(Δ).作者: Creatinine-Test 時(shí)間: 2025-3-23 22:54 作者: 人充滿活力 時(shí)間: 2025-3-24 03:58 作者: 胡言亂語 時(shí)間: 2025-3-24 08:06 作者: hypertension 時(shí)間: 2025-3-24 14:41 作者: ESO 時(shí)間: 2025-3-24 16:23 作者: justify 時(shí)間: 2025-3-24 22:17
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streamingices. An . -vertex fault-tolerant spanner is a subgraph which preserves approximate distances, under the failure of any set of at most . vertices. The contribution of this paper is twofold: we present algorithms for computing fault-tolerant spanners, and propose streaming algorithms for computing sp作者: mortuary 時(shí)間: 2025-3-24 23:24
https://doi.org/10.1007/978-3-642-14031-0Editing; Extension; Kernel; Permutation; automata; combinatorics; complexity; computational geometry; crypto作者: instate 時(shí)間: 2025-3-25 07:23 作者: 詞根詞綴法 時(shí)間: 2025-3-25 08:25
My T. Thai,Sartaj SahniUp-to-date results.Fast track conference proceedings.State-of-the-art report作者: 搖晃 時(shí)間: 2025-3-25 14:53 作者: left-ventricle 時(shí)間: 2025-3-25 19:06
Computing and Combinatorics978-3-642-14031-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 粗糙 時(shí)間: 2025-3-25 23:56
0302-9743 Overview: Up-to-date results.Fast track conference proceedings.State-of-the-art report978-3-642-14030-3978-3-642-14031-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CUB 時(shí)間: 2025-3-26 00:15
https://doi.org/10.1007/978-3-540-34262-5ly .-. and .-.. Specifically, we impose the additional requirement that each connected component of a solution have at least . vertices (resp. edges from the solution), and call the problem .-. (resp. .-.). We show that作者: 樂意 時(shí)間: 2025-3-26 07:55
Thermo-Dynamics of Plates and Shellsaptation of the arithmetic formula evaluation algorithm of Buss, Cook, Gupta, Ramachandran ([9]). We also show that the problem is #.. hard. Our results show that the difference between #. and #.. is captured exactly by the addition of a visible stack to a nondeterministic finite-state automata.作者: Ingenuity 時(shí)間: 2025-3-26 09:19
Concepts of stability analysis,ithm with round complexity .(Δ), where Δ is the maximal degree of ., improving the previous 3-approximation result with the same round complexity .(Δ). For the weighted case, we give a 4-approximation algorithm with round complexity .(Δ).作者: 茁壯成長(zhǎng) 時(shí)間: 2025-3-26 13:35 作者: Glucose 時(shí)間: 2025-3-26 20:21 作者: 饑荒 時(shí)間: 2025-3-26 21:54
Thermo-Dynamics of Plates and Shells,..]×[..,..]×???×[..,..]. The . of ., box(.) is the minimum integer . such that . can be represented as the intersection graph of .-dimensional boxes, i.e. each vertex is mapped to a .-dimensional box and two vertices are adjacent in . if and only if their corresponding boxes intersect. Let . be a p作者: Spartan 時(shí)間: 2025-3-27 02:22
Foundations of Engineering Mechanicsation, as there are general derandomization results which are based on the assumption that average-case hard functions exist. However, to achieve a complete derandomization, one usually needs a function which is extremely hard against a complexity class, in the sense that any algorithm in the class 作者: 說不出 時(shí)間: 2025-3-27 07:29 作者: GILD 時(shí)間: 2025-3-27 13:00 作者: 桶去微染 時(shí)間: 2025-3-27 16:34 作者: 從屬 時(shí)間: 2025-3-27 18:50
Foundations of Engineering Mechanics. Our results complement the recent lower bound of Ω(./8.) by Leonardos and Saks [LS09] and Ω(./2.) by Jayram, Kopparty and Raghavendra [JKR09] for randomized communication complexity of read-once Boolean formulas with depth ...We obtain our result by “embedding” either the Disjointness problem or i作者: arthroscopy 時(shí)間: 2025-3-28 00:51 作者: FLAX 時(shí)間: 2025-3-28 04:11
Summary of the Session by the Rapporteurollow-up papers. The input for the clustering problem consists of points in a metric space and a number ., specifying the desired number of clusters. The algorithms find a clustering that is provably close to a target clustering, provided that the instance has the “( 1?+?., .)-property”, which means作者: PACK 時(shí)間: 2025-3-28 09:14 作者: laxative 時(shí)間: 2025-3-28 14:10 作者: Notorious 時(shí)間: 2025-3-28 15:14
Concepts of stability analysis,ithm with round complexity .(Δ), where Δ is the maximal degree of ., improving the previous 3-approximation result with the same round complexity .(Δ). For the weighted case, we give a 4-approximation algorithm with round complexity .(Δ).作者: 施魔法 時(shí)間: 2025-3-28 19:48
Concepts of stability analysis,planar subgraph of a single-source embedded digraph is NP-complete. We then give a new characterization of upward planar single-source digraphs. We use this characterization to present an algorithm that computes a maximum upward planar single-source subgraph of a single-source embedded DAG. This alg作者: 多產(chǎn)子 時(shí)間: 2025-3-29 02:13 作者: Integrate 時(shí)間: 2025-3-29 04:52
Convection in cylindrical geometry,ed in a fixed order. We examine how fast this “deterministic random walk” covers all vertices (or all edges). We present general techniques to derive upper bounds for the vertex and edge cover time and derive matching lower bounds for several important graph classes. Depending on the topology, the d作者: 做方舟 時(shí)間: 2025-3-29 07:18 作者: 驚惶 時(shí)間: 2025-3-29 14:26
Convection in cylindrical geometry,Kanj and Xia and ..(1.1864.) by Razgon. In this paper, we will present a new way to analyze algorithms for the problem. We use . to measure the size of the search tree, and then get a simple .-time algorithm, where .. is the number of vertices with degree ≥?2 in the graph. Combining this result with作者: 哀求 時(shí)間: 2025-3-29 16:47 作者: eulogize 時(shí)間: 2025-3-29 22:08
The Curse of Connectivity: ,-Total Vertex (Edge) Coverly .-. and .-.. Specifically, we impose the additional requirement that each connected component of a solution have at least . vertices (resp. edges from the solution), and call the problem .-. (resp. .-.). We show that作者: installment 時(shí)間: 2025-3-30 00:23 作者: 戰(zhàn)勝 時(shí)間: 2025-3-30 05:22
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphsithm with round complexity .(Δ), where Δ is the maximal degree of ., improving the previous 3-approximation result with the same round complexity .(Δ). For the weighted case, we give a 4-approximation algorithm with round complexity .(Δ).作者: 背心 時(shí)間: 2025-3-30 09:20
https://doi.org/10.1007/978-3-540-34262-5s model, decreases exponentially depending only on the error of the original game and on the number of repetitions. There were no prior results for .-provers parallel repetition for .?>?2 in any model.作者: cornucopia 時(shí)間: 2025-3-30 15:41
J. Avellaner,C. Ortiz,F. Martínez,F. Sánchezer previous self-stabilizing solutions both for generality (arbitrary topology graphs . unit disk graphs or generalized disk graphs, respectively) and for approximation ratio, as it guarantees the number of its leaves is at least 1/3 of the maximum one. The time complexity of our algorithm is .(..) rounds.作者: Accommodation 時(shí)間: 2025-3-30 18:46
A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Models model, decreases exponentially depending only on the error of the original game and on the number of repetitions. There were no prior results for .-provers parallel repetition for .?>?2 in any model.作者: 協(xié)定 時(shí)間: 2025-3-31 00:16
A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networkser previous self-stabilizing solutions both for generality (arbitrary topology graphs . unit disk graphs or generalized disk graphs, respectively) and for approximation ratio, as it guarantees the number of its leaves is at least 1/3 of the maximum one. The time complexity of our algorithm is .(..) rounds.作者: 富足女人 時(shí)間: 2025-3-31 00:59 作者: 教育學(xué) 時(shí)間: 2025-3-31 07:43
Concepts of stability analysis,e this characterization to present an algorithm that computes a maximum upward planar single-source subgraph of a single-source embedded DAG. This algorithm takes .(..) time in the worst case and .(..) time on average.作者: Immunization 時(shí)間: 2025-3-31 10:02 作者: 弄臟 時(shí)間: 2025-3-31 15:27
https://doi.org/10.1007/BFb0109562m edge-cardinality biclique in convex bipartite graphs. Given a bipartite graph .?=?(., ., .) which is convex on ., we present a new algorithm that computes the maximum edge-cardinality biclique of . in .(. log.. loglog.) time and .(.) space, where .?=?|.|. This improves the current .(..) time bound available for the problem.作者: Organization 時(shí)間: 2025-3-31 18:16 作者: 外形 時(shí)間: 2025-4-1 01:15 作者: 檢查 時(shí)間: 2025-4-1 05:13 作者: cliche 時(shí)間: 2025-4-1 07:45
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraphe this characterization to present an algorithm that computes a maximum upward planar single-source subgraph of a single-source embedded DAG. This algorithm takes .(..) time in the worst case and .(..) time on average.作者: absorbed 時(shí)間: 2025-4-1 12:40 作者: 新陳代謝 時(shí)間: 2025-4-1 18:03
Finding Maximum Edge Bicliques in Convex Bipartite Graphsm edge-cardinality biclique in convex bipartite graphs. Given a bipartite graph .?=?(., ., .) which is convex on ., we present a new algorithm that computes the maximum edge-cardinality biclique of . in .(. log.. loglog.) time and .(.) space, where .?=?|.|. This improves the current .(..) time bound available for the problem.