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
- Authors
- Kim, S.K.
- Issue Date
- Mar-1996
- Publisher
- Elsevier
- Keywords
- Adjacency list; Algorithms; Compact sets; Graphs
- Citation
- Information Processing Letters, v.57, no.6, pp 335 - 338
- Pages
- 4
- Journal Title
- Information Processing Letters
- Volume
- 57
- Number
- 6
- Start Page
- 335
- End Page
- 338
- ISSN
- 0020-0190
1872-6119
- 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.
- 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.