1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorDAS, SRen_US
dc.contributor.authorSHENG, CLen_US
dc.contributor.authorCHEN, Zen_US
dc.date.accessioned2014-12-08T15:06:32Z-
dc.date.available2014-12-08T15:06:32Z-
dc.date.issued1978en_US
dc.identifier.issn0045-7906en_US
dc.identifier.urihttp://hdl.handle.net/11536/5108-
dc.language.isoen_USen_US
dc.titleALGORITHM FOR FINDING ALL MAXIMAL COMPLETE SUBGRAPHS AND AN ESTIMATE OF THE ORDER OF COMPUTATIONAL COMPLEXITYen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & ELECTRICAL ENGINEERINGen_US
dc.citation.volume5en_US
dc.citation.issue4en_US
dc.citation.spage365en_US
dc.citation.epage368en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1978GP05900008-
dc.citation.woscount1-
Appears in Collections:Articles


Related Contents
Loading...