Statistical graph of processing time of each algorithm in six experimental networks when K = 30 and p = 0.01.

<p>Statistical graph of processing time of each algorithm in six experimental networks when K = 30 and p = 0.01.</p>

محفوظ في:

التفاصيل البيبلوغرافية
المؤلف الرئيسي:	Lihong Han (7280045) (author)
مؤلفون آخرون:	Kan Yang (49193) (author), Yang Ming (1607095) (author), Jianxin Tang (1731898) (author)
منشور في:	2025
الموضوعات:	Biotechnology Science Policy Space Science Environmental Sciences not elsewhere classified Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Information Systems not elsewhere classified six datasets show seen increasing application scale social networks certain spreading model solving im problems influence maximization research based optimization algorithms influence maximization heuristic algorithms art algorithms xlink "> swarm intelligence seed nodes recent years parallel computing notable improvements network reach experiments conducted evolution characteristics added advantages
الوسوم:	إضافة وسم لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!

مواد مشابهة