EFFICIENT ALGORITHM FOR K-WAY PARTITIONING OF A GRAPH.

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 364
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorPark, Chan-Ikko
dc.contributor.authorPark, Kyu Hoko
dc.contributor.authorKim, Myunghwanko
dc.date.accessioned2013-03-14T07:15:46Z-
dc.date.available2013-03-14T07:15:46Z-
dc.date.created2012-02-06-
dc.date.issued1987-08-
dc.identifier.citationProceedings - TENCON 87: 1987 IEEE Region 10 Conference, 'Computers and Communications Technology Toward 2000'., pp.463 - 466-
dc.identifier.urihttp://hdl.handle.net/10203/106447-
dc.languageEnglish-
dc.publisherIEEE-
dc.titleEFFICIENT ALGORITHM FOR K-WAY PARTITIONING OF A GRAPH.-
dc.typeConference-
dc.identifier.scopusid2-s2.0-0023535773-
dc.type.rimsCONF-
dc.citation.beginningpage463-
dc.citation.endingpage466-
dc.citation.publicationnameProceedings - TENCON 87: 1987 IEEE Region 10 Conference, 'Computers and Communications Technology Toward 2000'.-
dc.identifier.conferencecountryKO-
dc.identifier.conferencelocationSheraton Walker Hill Hotel, Seoul-
dc.contributor.localauthorPark, Kyu Ho-
dc.contributor.localauthorKim, Myunghwan-
dc.contributor.nonIdAuthorPark, Chan-Ik-
Appears in Collection
EE-Conference Papers(학술회의논문)
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