A fast algorithm for finding the compact sets

DOI10.1016/0020-0190(91)90092-VMaRDI QIDQ1178253zbMATH OpenOpenAlexWikidataFDO

Authors Dejan Živković

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

zbMATH Keywords

compact setsgraph algorithmsprogram correctness

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An optimal algorithm for finding compact sets
• Publication:4862250
• Algorithms - ESA 2003
• A fast algorithm for finding interlocking sets
• Fast sequential and parallel algorithms for finding extremal sets
• Fast algorithms for computing the diameter of a finite planar set
• scientific article; zbMATH DE number 4041267
• Fast and accurate computation of the logarithmic capacity of compact sets

Cited in

(6)

• An optimal algorithm for finding compact sets
• A fast algorithm for finding interlocking sets
• A note on finding compact sets in graphs represented by an adjacency list
• An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
• scientific article; zbMATH DE number 3887732 (Why is no real title available?)
• scientific article; zbMATH DE number 842029 (Why is no real title available?)

This page was built for publication: A fast algorithm for finding the compact sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178253)