Titlebook: Mathematical Foundations of Computer Science 2007; 32nd International S Luděk Ku?era,Antonín Ku?era Conference proceedings 2007 Springer-Ve

Destruct

書目名稱Mathematical Foundations of Computer Science 2007影響因子(影響力)




書目名稱Mathematical Foundations of Computer Science 2007影響因子(影響力)學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2007網(wǎng)絡(luò)公開度




書目名稱Mathematical Foundations of Computer Science 2007網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2007被引頻次




書目名稱Mathematical Foundations of Computer Science 2007被引頻次學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2007年度引用




書目名稱Mathematical Foundations of Computer Science 2007年度引用學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2007讀者反饋




書目名稱Mathematical Foundations of Computer Science 2007讀者反饋學(xué)科排名

Jacket

Throttle

蜈蚣

Hot-Flash

期滿

Expander Properties and the Cover Time of Random Intersection Graphs (a) random intersection graphs are expanders, (b) random walks on such graphs are “rapidly mixing” (in particular they mix in logarithmic time) and (c) the cover time of random walks on such graphs is optimal (i.e. it is .(. log.)). All results are proved for . very close to the connectivity thresh

儀式

vitreous-humor

Rewriting Conjunctive Queries Determined by Viewstructing rewritings is a widely studied technique to derive those answers. In this paper we consider the problem of existence of rewritings in the case where the answers to the views uniquely determine the answers to the query. Specifically, we say that a view set .. a query . if for any two databas

HEDGE

Approximation Algorithms for the Maximum Internal Spanning Tree Problemw, this problem is equivalent to the . problem, and is NP-hard as being a generalization of the . problem. Although there is no constant factor approximation for the . problem [1], . can be approximated within a factor of 2 [2]..In this paper we improve this factor by giving a .-approximation algori

altruism

New Approximability Results for 2-Dimensional Packing Problemsmation schemes for this problem without and with 90. rotations. The additive constant in the approximation ratios of both algorithms is 1, improving on the additive term in the approximation ratios of the algorithm by Kenyon and Rémila (for the problem without rotations) and Jansen and van Stee (for