Titlebook: Computing and Combinatorics; First Annual Interna Ding-Zhu Du,Ming Li Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 Co

subcutaneous

书目名称Computing and Combinatorics影响因子(影响力)




书目名称Computing and Combinatorics影响因子(影响力)学科排名




书目名称Computing and Combinatorics网络公开度




书目名称Computing and Combinatorics网络公开度学科排名




书目名称Computing and Combinatorics被引频次




书目名称Computing and Combinatorics被引频次学科排名




书目名称Computing and Combinatorics年度引用




书目名称Computing and Combinatorics年度引用学科排名




书目名称Computing and Combinatorics读者反馈




书目名称Computing and Combinatorics读者反馈学科排名

心胸狭窄

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

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

古老

用树皮

朝圣者

朝圣者

严重伤害

顽固

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

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