Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A note on finding compact sets in graphs represented by an adjacency list
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, S.K. | - |
| dc.date.accessioned | 2023-02-09T08:44:38Z | - |
| dc.date.available | 2023-02-09T08:44:38Z | - |
| dc.date.issued | 1996-03 | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.issn | 1872-6119 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60383 | - |
| dc.description.abstract | Dekel, Hu and Ouyang presented an O (N2) time algorithm for finding all compact sets of an edge-weighted graph G with M edges and N vertices. This is optimal provided G is represented by an adjacency matrix. Assuming G is represented by an adjacency list, we present an improved implementation of their algorithm which takes O(M + N log N) time to find and O(L) time to list all the compact sets, where L is the sum of the sizes of all compact sets of G. | - |
| dc.format.extent | 4 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Elsevier | - |
| dc.title | A note on finding compact sets in graphs represented by an adjacency list | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1016/0020-0190(96)00017-8 | - |
| dc.identifier.bibliographicCitation | Information Processing Letters, v.57, no.6, pp 335 - 338 | - |
| dc.description.isOpenAccess | N | - |
| dc.identifier.scopusid | 2-s2.0-0043042008 | - |
| dc.citation.endPage | 338 | - |
| dc.citation.number | 6 | - |
| dc.citation.startPage | 335 | - |
| dc.citation.title | Information Processing Letters | - |
| dc.citation.volume | 57 | - |
| dc.type.docType | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.subject.keywordAuthor | Adjacency list | - |
| dc.subject.keywordAuthor | Algorithms | - |
| dc.subject.keywordAuthor | Compact sets | - |
| dc.subject.keywordAuthor | Graphs | - |
| dc.description.journalRegisteredClass | scopus | - |
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.