An O(NLogn/Log Log N)Parallel Maximum Matching Algorithm for Bipartite Graphs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Taenam Kim | ko |
| dc.contributor.author | Chwa, Kyung Yong | ko |
| dc.date.accessioned | 2013-02-25T05:48:17Z | - |
| dc.date.available | 2013-02-25T05:48:17Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1987-01 | - |
| dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.24, no.1, pp.15 - 17 | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/60369 | - |
| dc.language | English | - |
| dc.publisher | Elsevier Science Bv | - |
| dc.title | An O(NLogn/Log Log N)Parallel Maximum Matching Algorithm for Bipartite Graphs | - |
| dc.type | Article | - |
| dc.identifier.wosid | A1987G036200004 | - |
| dc.identifier.scopusid | 2-s2.0-0023133126 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 24 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 15 | - |
| dc.citation.endingpage | 17 | - |
| dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
| dc.contributor.localauthor | Chwa, Kyung Yong | - |
| dc.contributor.nonIdAuthor | Taenam Kim | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 3 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.