An optimal algorithm for finding compact sets
From MaRDI portal
Publication:1209360
DOI10.1016/0020-0190(92)90215-HzbMath0768.68039MaRDI QIDQ1209360
Jie Hu, Wen Ouyang, Eliezer Dekel
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph ⋮ A note on finding compact sets in graphs represented by an adjacency list
Cites Work
This page was built for publication: An optimal algorithm for finding compact sets