ALGORITHM FOR FINDING ALL MAXIMAL COMPLETE SUBGRAPHS AND AN ESTIMATE OF THE ORDER OF COMPUTATIONAL COMPLEXITY

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	DAS, SR	en_US
dc.contributor.author	SHENG, CL	en_US
dc.contributor.author	CHEN, Z	en_US
dc.date.accessioned	2014-12-08T15:06:32Z	-
dc.date.available	2014-12-08T15:06:32Z	-
dc.date.issued	1978	en_US
dc.identifier.issn	0045-7906	en_US
dc.identifier.uri	http://hdl.handle.net/11536/5108	-
dc.language.iso	en_US	en_US
dc.title	ALGORITHM FOR FINDING ALL MAXIMAL COMPLETE SUBGRAPHS AND AN ESTIMATE OF THE ORDER OF COMPUTATIONAL COMPLEXITY	en_US
dc.type	Article	en_US
dc.identifier.journal	COMPUTERS & ELECTRICAL ENGINEERING	en_US
dc.citation.volume	5	en_US
dc.citation.issue	4	en_US
dc.citation.spage	365	en_US
dc.citation.epage	368	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1978GP05900008	-
dc.citation.woscount	1	-
顯示於類別：	期刊論文