A fast algorithm for finding the compact sets
From MaRDI portal
Publication:1178253
DOI10.1016/0020-0190(91)90092-VzbMath0736.68047OpenAlexW2061974355WikidataQ126643586 ScholiaQ126643586MaRDI QIDQ1178253
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90092-v
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph ⋮ An optimal algorithm for finding compact sets
Cites Work
This page was built for publication: A fast algorithm for finding the compact sets