QQ客服 官方微博 反馈留言

	MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs
	Wang, Pinghui; Zhao, Junzhou; Zhang, Xiangliang; Li, Zhenguo; Cheng, Jiefeng; Lui, John C. S.; Towsley, Don; Tao, Jing; Guan, Xiaohong
刊名	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
	2018
卷号	30页码:73-86
关键词	Graphlet kernel subgraph sampling graph mining
ISSN号	1041-4347
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2914265
专题	西安交通大学
推荐引用方式 GB/T 7714	Wang, Pinghui,Zhao, Junzhou,Zhang, Xiangliang,et al. MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs[J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,2018,30:73-86.
APA	Wang, Pinghui.,Zhao, Junzhou.,Zhang, Xiangliang.,Li, Zhenguo.,Cheng, Jiefeng.,...&Guan, Xiaohong.(2018).MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs.IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,30,73-86.
MLA	Wang, Pinghui,et al."MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs".IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 30(2018):73-86.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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