Sparse Matrix의 Bandwidth 에 관한 연구An Algorithm for Bandwidth Minimization of Sparse Matrix

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 339
  • Download : 0
DC FieldValueLanguage
dc.contributor.author김길창ko
dc.contributor.author유기영ko
dc.date.accessioned2013-02-25T15:52:44Z-
dc.date.available2013-02-25T15:52:44Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1977-12-
dc.identifier.citation정보과학회논문지, v.4, no.2, pp.24 - 28-
dc.identifier.issn0258-9125-
dc.identifier.urihttp://hdl.handle.net/10203/63339-
dc.languageKorean-
dc.publisher한국정보과학회-
dc.titleSparse Matrix의 Bandwidth 에 관한 연구-
dc.title.alternativeAn Algorithm for Bandwidth Minimization of Sparse Matrix-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume4-
dc.citation.issue2-
dc.citation.beginningpage24-
dc.citation.endingpage28-
dc.citation.publicationname정보과학회논문지-
dc.contributor.nonIdAuthor유기영-
dc.description.isOpenAccessN-
Appears in Collection
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0