Destruct
发表于 2025-3-21 16:37:52
书目名称Mathematical Foundations of Computer Science 2007影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0626141<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2007读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0626141<br><br> <br><br>
Jacket
发表于 2025-3-21 20:58:29
http://reply.papertrans.cn/63/6262/626141/626141_2.png
Throttle
发表于 2025-3-22 03:25:36
http://reply.papertrans.cn/63/6262/626141/626141_3.png
蜈蚣
发表于 2025-3-22 04:55:27
http://reply.papertrans.cn/63/6262/626141/626141_4.png
Hot-Flash
发表于 2025-3-22 08:53:27
http://reply.papertrans.cn/63/6262/626141/626141_5.png
期满
发表于 2025-3-22 15:24:17
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
仪式
发表于 2025-3-22 17:49:11
http://reply.papertrans.cn/63/6262/626141/626141_7.png
vitreous-humor
发表于 2025-3-22 23:01:49
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
发表于 2025-3-23 05:13:49
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 , . can be approximated within a factor of 2 ..In this paper we improve this factor by giving a .-approximation algori
altruism
发表于 2025-3-23 08:12:02
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