Full metadata record
DC FieldValueLanguage
dc.contributor.authorDAS, SRen_US
dc.contributor.authorCHEN, Zen_US
dc.contributor.authorLEE, SYen_US
dc.contributor.authorLIN, Ten_US
dc.contributor.authorSHENG, CLen_US
dc.date.accessioned2014-12-08T15:06:23Z-
dc.date.available2014-12-08T15:06:23Z-
dc.date.issued1983en_US
dc.identifier.issn0020-7160en_US
dc.identifier.urihttp://hdl.handle.net/11536/4947-
dc.language.isoen_USen_US
dc.titleCOMPLEXITY AND PERFORMANCE OF A GRAPH-THEORY ALGORITHM FOR CLUSTER-ANALYSISen_US
dc.typeArticleen_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMPUTER MATHEMATICSen_US
dc.citation.volume13en_US
dc.citation.issue1en_US
dc.citation.spage41en_US
dc.citation.epage50en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1983QG64600003-
dc.citation.woscount0-
Appears in Collections:Articles