children
发表于 2025-3-21 17:07:48
书目名称Resilient Design and Construction of Geostructures Against Natural Hazards影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0828370<br><br> <br><br>书目名称Resilient Design and Construction of Geostructures Against Natural Hazards读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0828370<br><br> <br><br>
Sleep-Paralysis
发表于 2025-3-21 20:42:40
Resilient Design and Construction of Geostructures Against Natural Hazards978-3-030-79854-3Series ISSN 2366-3405 Series E-ISSN 2366-3413
巫婆
发表于 2025-3-22 01:54:09
Sustainable Civil Infrastructureshttp://image.papertrans.cn/r/image/828370.jpg
genesis
发表于 2025-3-22 05:58:47
https://doi.org/10.1007/978-3-030-79854-3Ground Improvement; Earthquake Geotechnical Engineering; Tunneling in Difficult Ground; Computational G
全等
发表于 2025-3-22 10:56:39
http://reply.papertrans.cn/83/8284/828370/828370_5.png
无弹性
发表于 2025-3-22 15:11:29
no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the su978-3-642-78242-8978-3-642-78240-4Series ISSN 0937-5511 Series E-ISSN 2197-6783
larder
发表于 2025-3-22 20:35:20
http://reply.papertrans.cn/83/8284/828370/828370_7.png
外来
发表于 2025-3-23 00:14:47
http://reply.papertrans.cn/83/8284/828370/828370_8.png
regale
发表于 2025-3-23 04:18:31
Zhuang Miao,Fangtong Wang,Chia Zarei,Yong Liuaki, Hajime Ono, Jiyuan Han, Jeff A. Viaclovsky, Bruce Kleiner, John Lott, Sławomir Kołodziej, Ngoc Cuong Nguyen, Chi Li, Yuchen Liu, Chenyang Xu, YanYan Li, Luc Nguyen, Bo Wang, Shiguang Ma,978-3-030-34955-4978-3-030-34953-0Series ISSN 0743-1643 Series E-ISSN 2296-505X
旋转一周
发表于 2025-3-23 05:52:33
Md Rafiue Islam,Zahid Hossain classes of graphs which are in fact characterized by such a condition, most notably the class of perfect graphs. Using this approach, we shall develop a polynomial time algorithm for the stable set problem for perfect graphs. So far no purely combinatorial algorithm has been found to solve this pro