標(biāo)題: Titlebook: Computing and Combinatorics; First Annual Interna Ding-Zhu Du,Ming Li Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 Co [打印本頁] 作者: subcutaneous 時間: 2025-3-21 17:28
書目名稱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 23:29
Approximation of coNP sets by NP-complete sets,ation .′. such that .′. ? .. and .′. - .. is infinite. When ..=P and ..=NP, it is known that there is no optimal approximation under a quite general condition unless P=NP. In this paper we discuss the case where ..=the class of NP-complete sets and ..=coNP. A similar result as above that shows the d作者: Pandemic 時間: 2025-3-22 02:48
How to draw a planar clustered graph, convex drawings of clustered graphs in .(n.) time. We also demonstrate an area lower bound and an angle upper bound for straight-line convex drawings of C-planar graphs. We show that such drawings require .(2.) area and the smallest angle is .. Our bounds are unlike the area and angle bounds of cla作者: 古老 時間: 2025-3-22 07:38 作者: 用樹皮 時間: 2025-3-22 10:30 作者: 朝圣者 時間: 2025-3-22 16:48 作者: 朝圣者 時間: 2025-3-22 18:42 作者: 嚴(yán)重傷害 時間: 2025-3-22 21:33 作者: 頑固 時間: 2025-3-23 04:02
Maximum tree-packing in time ,(n,),able in time .(n. n.). The same asymptotic bounds are observed for the corresponding problems where topological imbedding and subgraph homeomorphism are respectively substituted for subgraph isomorphism.作者: Polydipsia 時間: 2025-3-23 07:23
Optimal algorithms for finding connected components of an unknown graph,he oracle tells us the vertices connected to .. We want to use the minimum number of queries, adaptively, to find the components. The problem is also known as interconnect diagnosis of wiring networks in VLSI. The graph has . vertices and . components, but . is not part of the input. We present a de作者: angiography 時間: 2025-3-23 10:24
Algorithmic graph embeddings,d shown to be superior to the previously known data structures. In particular, the new data structure efficiently supports all on-line operations for general graph embeddings. Based on this new data structure, very efficient algorithms are developed to solve the problem “given a graph . and an integ作者: PLUMP 時間: 2025-3-23 15:04
Analysis of quorum-based protocols for distributed (k+1)-exclusion,ums of varying sizes and availabilities indexed by integral divisors . of .. The cases .=1 and . correspond to known majority based quorum generation algorithms . and ., whereas intermediate values of . interpolate between these two extremes. A cost and availability analysis of the proposed methods 作者: notification 時間: 2025-3-23 20:25
A highly fault-tolerant quorum consensus method for managing replicated data,ly applied to managing replicated data. In this paper, we present a new QC method. The proposed QC approach has a low message overhead: 1) In the best case, each transaction operation process needs only to communicate with . remote sites (. is the number of sites storing the manipulating data item).作者: Kaleidoscope 時間: 2025-3-24 00:21
Constructing Craig interpolation formulas,nstructing a Craig interpolant from a refutation proof which involves binary resolution, paramodulation, and factoring. This method can solve the machine learning problem of discovering a first order concept from given examples. It can also be used to find sentences which distinguish pairs of noniso作者: addition 時間: 2025-3-24 03:40 作者: thwart 時間: 2025-3-24 08:29 作者: 有效 時間: 2025-3-24 12:12 作者: botany 時間: 2025-3-24 17:26
Thermodynamik für Maschinenbauerable in time .(n. n.). The same asymptotic bounds are observed for the corresponding problems where topological imbedding and subgraph homeomorphism are respectively substituted for subgraph isomorphism.作者: Admire 時間: 2025-3-24 19:15 作者: anus928 時間: 2025-3-25 02:03 作者: 光明正大 時間: 2025-3-25 07:05 作者: 規(guī)范要多 時間: 2025-3-25 10:55 作者: Expediency 時間: 2025-3-25 12:21
,?quivalenz von W?rme und Arbeit,In ., one can decompose an .-vertex rectilinear polygon into . rectangles, allowing Steiner points, so that any horizontal or vertical segment inside the polygon intersects .(log.) rectangles.作者: slow-wave-sleep 時間: 2025-3-25 16:48 作者: PANEL 時間: 2025-3-25 21:57 作者: 陰郁 時間: 2025-3-26 00:22 作者: commute 時間: 2025-3-26 06:28 作者: acquisition 時間: 2025-3-26 10:21
Rectangulating rectilinear polygons in parallel,In ., one can decompose an .-vertex rectilinear polygon into . rectangles, allowing Steiner points, so that any horizontal or vertical segment inside the polygon intersects .(log.) rectangles.作者: conference 時間: 2025-3-26 14:50 作者: Carcinogen 時間: 2025-3-26 20:27
,Testing containment of object-oriented conjunctive queries is ∏ 2 p -hard,We study the complexity of testing containment for a class of object-oriented conjunctive queries. We show that the containment problem is ∏.-hard. Together with a previous result, the containment problem is complete in ∏..作者: commute 時間: 2025-3-26 21:56
Computations with finite closure systems and implications, C ? 2. Irr(C) . Σ. . (a),(b),... (g) ..作者: 外形 時間: 2025-3-27 01:20 作者: TRUST 時間: 2025-3-27 07:36
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234779.jpg作者: 厚顏無恥 時間: 2025-3-27 11:09 作者: 使增至最大 時間: 2025-3-27 16:27
Thermodynamik für Maschinenbaueration .′. such that .′. ? .. and .′. - .. is infinite. When ..=P and ..=NP, it is known that there is no optimal approximation under a quite general condition unless P=NP. In this paper we discuss the case where ..=the class of NP-complete sets and ..=coNP. A similar result as above that shows the d作者: aesthetician 時間: 2025-3-27 19:18 作者: ARENA 時間: 2025-3-28 00:42
Der zweite Hauptsatz und die Entropie,imitations neither to planar nor to biconnected graphs, we reach the best known results in the literarture: each edge has at most 1 bend, the total number of bends is ≤ ./2+1, and the area is ≤(./2?1)..作者: Middle-Ear 時間: 2025-3-28 02:41 作者: 擴音器 時間: 2025-3-28 07:47
Der zweite Hauptsatz der Thermodynamik,f a triangle . from another triangle . among general scenes, which are a set of . disjoint triangles. We also consider the cases when the scenes are rectilinear objects and polyhedral terrains. We show that in these special situations the weakly visible regions can be computed much faster in .(..) t作者: 枯燥 時間: 2025-3-28 12:07 作者: GROG 時間: 2025-3-28 15:49 作者: 良心 時間: 2025-3-28 22:10
Thermodynamik für Maschinenbauerable in time .(n. n.). The same asymptotic bounds are observed for the corresponding problems where topological imbedding and subgraph homeomorphism are respectively substituted for subgraph isomorphism.作者: GOUGE 時間: 2025-3-28 23:42
,Einheiten physikalischer Gr??en,he oracle tells us the vertices connected to .. We want to use the minimum number of queries, adaptively, to find the components. The problem is also known as interconnect diagnosis of wiring networks in VLSI. The graph has . vertices and . components, but . is not part of the input. We present a de作者: tattle 時間: 2025-3-29 05:08
,?quivalenz von W?rme und Arbeit,d shown to be superior to the previously known data structures. In particular, the new data structure efficiently supports all on-line operations for general graph embeddings. Based on this new data structure, very efficient algorithms are developed to solve the problem “given a graph . and an integ作者: 厭煩 時間: 2025-3-29 10:33
Thermodynamik für Maschinenbauerums of varying sizes and availabilities indexed by integral divisors . of .. The cases .=1 and . correspond to known majority based quorum generation algorithms . and ., whereas intermediate values of . interpolate between these two extremes. A cost and availability analysis of the proposed methods 作者: 四海為家的人 時間: 2025-3-29 14:38
Thermodynamik für Maschinenbauerly applied to managing replicated data. In this paper, we present a new QC method. The proposed QC approach has a low message overhead: 1) In the best case, each transaction operation process needs only to communicate with . remote sites (. is the number of sites storing the manipulating data item).作者: Fraudulent 時間: 2025-3-29 18:37
Thermodynamik für Maschinenbauernstructing a Craig interpolant from a refutation proof which involves binary resolution, paramodulation, and factoring. This method can solve the machine learning problem of discovering a first order concept from given examples. It can also be used to find sentences which distinguish pairs of noniso作者: Finasteride 時間: 2025-3-29 23:20 作者: NUL 時間: 2025-3-30 00:01
An efficient orthogonal grid drawing algorithm for cubic graphs,imitations neither to planar nor to biconnected graphs, we reach the best known results in the literarture: each edge has at most 1 bend, the total number of bends is ≤ ./2+1, and the area is ≤(./2?1)..作者: MUTE 時間: 2025-3-30 06:16
Maximum tree-packing in time ,(n,),able in time .(n. n.). The same asymptotic bounds are observed for the corresponding problems where topological imbedding and subgraph homeomorphism are respectively substituted for subgraph isomorphism.作者: overrule 時間: 2025-3-30 09:46 作者: 復(fù)習(xí) 時間: 2025-3-30 12:39
Constructing Craig interpolation formulas,nstructing a Craig interpolant from a refutation proof which involves binary resolution, paramodulation, and factoring. This method can solve the machine learning problem of discovering a first order concept from given examples. It can also be used to find sentences which distinguish pairs of nonisomorphic finite structures.作者: 停止償付 時間: 2025-3-30 17:30
0302-9743 , China in August 1995..The 52 thoroughly refereed full papers and the 22 short presentations included in this volume were selected from a total of 120 submissions. All current aspects of theoretical computer science and combinatorial mathematics related to computing are addressed; in particular, th作者: Predigest 時間: 2025-3-30 21:11
Thermodynamik für Maschinenbauerondition unless P=NP. In this paper we discuss the case where ..=the class of NP-complete sets and ..=coNP. A similar result as above that shows the difficulty of the optimal approximation is obtained. Approximating coNP sets by NP-complete sets play an important role in the efficient generation of test instances for combinatorial algorithms.作者: 河流 時間: 2025-3-31 02:10
Der zweite Hauptsatz der Thermodynamik,ectilinear objects and polyhedral terrains. We show that in these special situations the weakly visible regions can be computed much faster in .(..) time and .(..) space. With these results, we obtain the first known polynomial time algorithm to decide whether or not a simple polyhedron is weakly (internally or externally) visible.作者: HOWL 時間: 2025-3-31 08:45 作者: Cuisine 時間: 2025-3-31 13:02 作者: GLADE 時間: 2025-3-31 13:20 作者: Neutral-Spine 時間: 2025-3-31 18:02
,?quivalenz von W?rme und Arbeit,general graph embeddings. Based on this new data structure, very efficient algorithms are developed to solve the problem “given a graph . and an integer ., construct a genus . embedding for the graph .” for a large range of the integers . and for a large class of graphs.作者: osteocytes 時間: 2025-4-1 01:15
https://doi.org/10.1007/3-540-32320-1ight triangles) that give a lower bound for the minimum weight triangulation. We also prove directly a third matching theorem for triangulations. We show that the set of light edges is a superset of some subsets of edges of a minimum weight triangulation that were studied before.作者: lipids 時間: 2025-4-1 05:28
Constrained independence system and triangulations of planar point sets,ight triangles) that give a lower bound for the minimum weight triangulation. We also prove directly a third matching theorem for triangulations. We show that the set of light edges is a superset of some subsets of edges of a minimum weight triangulation that were studied before.作者: 不幸的人 時間: 2025-4-1 08:26
Conference proceedings 1995 August 1995..The 52 thoroughly refereed full papers and the 22 short presentations included in this volume were selected from a total of 120 submissions. All current aspects of theoretical computer science and combinatorial mathematics related to computing are addressed; in particular, there are se作者: Stress 時間: 2025-4-1 13:23 作者: 基因組 時間: 2025-4-1 14:27
Three dimensional weak visibility: Complexity and applications,ectilinear objects and polyhedral terrains. We show that in these special situations the weakly visible regions can be computed much faster in .(..) time and .(..) space. With these results, we obtain the first known polynomial time algorithm to decide whether or not a simple polyhedron is weakly (internally or externally) visible.作者: 廣大 時間: 2025-4-1 19:49
Computing infinite relations using finite expressions: A new approach to the safety issue in relatilculus. An algorithm which can symbolically handle infinite relations is designed to efficiently compute all these relations. Therefore the constraint of finiteness on relational calculus can be removed.作者: FAZE 時間: 2025-4-1 23:50
