QQ客服 官方微博 反馈留言

	Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations
	Zhao, Junzhou; Wang, Pinghui; Lui, John C.S.
刊名	Information Sciences
	2019
卷号	477页码:161-185
关键词	Greedy algorithms MCMC simulation Near-optimal solutions Optimization problems Problem definition Random Walk Set function Three orders of magnitude
ISSN号	0020-0255
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2826514
专题	西安交通大学
推荐引用方式 GB/T 7714	Zhao, Junzhou,Wang, Pinghui,Lui, John C.S.. Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations[J]. Information Sciences,2019,477:161-185.
APA	Zhao, Junzhou,Wang, Pinghui,&Lui, John C.S..(2019).Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations.Information Sciences,477,161-185.
MLA	Zhao, Junzhou,et al."Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations".Information Sciences 477(2019):161-185.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。