【已完结】 Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 搜知猫 - 外文文献互助服务平台

文献求助详情已完结

标题	Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs
网址	http://dx.doi.org/10.3390/a13090211
DOI	10.3390/a13090211
其他	期刊：Algorithms 作者：Pierluigi Crescenzi;Clémence Magnien;Andrea Marino 出版日期：2020
求助人	是否不一样爱在 2022-08-10 03:16:10 发布，悬赏 20 积分
下载

求助 / 应助时间线

该求助已完结，感谢关注

如需该文献，请重新发布求助，前往发布

不忘初心，牢记使命，为科研工作者服务

请遵守相关知识产权规定，勿将文件分享给他人，仅可用于个人研究学习

热门搜索

Vaccinology Education of Nurses and the Current Immunoprophylaxis Recommendations for Children with Juvenile Idiopathic Arthritis
Joule Heating-Induced Carbon Fibers for Flexible Fiber Supercapacitor Electrodes
The Role of Liver Imaging in Hereditary Hemorrhagic Telangiectasia
Effects of Elevated Platform and Robotic Vehicle on Broiler Production, Welfare, and Housing Environment
Still Living Better through Chemistry: An Update on Caloric Restriction and Caloric Restriction Mimetics as Tools to Promote Health and Lifespan
Fractional Diffusion–Wave Equation with Application in Electrodynamics
Influence of Photon-Induced Photoacoustic Streaming (PIPS) on Root Canal Disinfection and Post-Operative Pain: A Randomized Clinical Trial
The Effect of Syntactic Impairment on Errors in Reading Aloud: Text Reading and Comprehension of Deaf and Hard of Hearing Children
Peer Review of “Machine Learning and Medication Adherence: Scoping Review” (Preprint)
Enterocutaneous fistula; Management Challenges,Areterospective Review of 11 Patients Treated in our Institute

高分求助

常见问题

今日热心研友更多

注：热心度 = 本日应助数 + 本日被采纳获取的积分/10