QQ客服 官方微博 反馈留言

	A fast parallel algorithm for finding the largest common 4-connected component from two matrices (EI收录)
	Gao, Ying[1]; Liu, Haoshen[1]; Huang, Jiancong[1]; Duan, Jiajie[2]; Mu, Lei[3]
刊名	Tehnicki Vjesnik
	2016
卷号	23页码:979-984
关键词	Parallel algorithms Problem solving
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2197138
专题	华南理工大学
作者单位	1.[1] School of Computer Science and Engineering, South China University of Technology, Waihuan Dong Road No. 382, Panyu District, Guangzhou, China 2.[2] YunNan Electric Power Test & Research Institute Group CO. Ltd, China 3.[3] Huanggang Dong Road, Tiaoqiao District, JiNan 4.Shangdong Province, China
推荐引用方式 GB/T 7714	Gao, Ying[1],Liu, Haoshen[1],Huang, Jiancong[1],等. A fast parallel algorithm for finding the largest common 4-connected component from two matrices (EI收录)[J]. Tehnicki Vjesnik,2016,23:979-984.
APA	Gao, Ying[1],Liu, Haoshen[1],Huang, Jiancong[1],Duan, Jiajie[2],&Mu, Lei[3].(2016).A fast parallel algorithm for finding the largest common 4-connected component from two matrices (EI收录).Tehnicki Vjesnik,23,979-984.
MLA	Gao, Ying[1],et al."A fast parallel algorithm for finding the largest common 4-connected component from two matrices (EI收录)".Tehnicki Vjesnik 23(2016):979-984.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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