COMPLEXITY AND PERFORMANCE OF A GRAPH-THEORY ALGORITHM FOR CLUSTER-ANALYSIS

Full metadata record

DC Field	Value	Language
dc.contributor.author	DAS, SR	en_US
dc.contributor.author	CHEN, Z	en_US
dc.contributor.author	LEE, SY	en_US
dc.contributor.author	LIN, T	en_US
dc.contributor.author	SHENG, CL	en_US
dc.date.accessioned	2014-12-08T15:06:23Z	-
dc.date.available	2014-12-08T15:06:23Z	-
dc.date.issued	1983	en_US
dc.identifier.issn	0020-7160	en_US
dc.identifier.uri	http://hdl.handle.net/11536/4947	-
dc.language.iso	en_US	en_US
dc.title	COMPLEXITY AND PERFORMANCE OF A GRAPH-THEORY ALGORITHM FOR CLUSTER-ANALYSIS	en_US
dc.type	Article	en_US
dc.identifier.journal	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS	en_US
dc.citation.volume	13	en_US
dc.citation.issue	1	en_US
dc.citation.spage	41	en_US
dc.citation.epage	50	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1983QG64600003	-
dc.citation.woscount	0	-
Appears in Collections:	Articles