An optimal algorithm for finding compact sets

DOI10.1016/0020-0190(92)90215-HMaRDI QIDQ1209360zbMATH OpenFDO

Authors Eliezer Dekel, Jie Hu, Wen Ouyang

Publication date 16 May 1993

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treeoptimal algorithmcompact setsweighted undirected graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A fast algorithm for finding the compact sets
• A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
• A note on finding compact sets in graphs represented by an adjacency list
• Publication:4862250
• An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 922897 (Why is no real title available?)
• A fast algorithm for finding the compact sets

Cited in

(8)

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

This page was built for publication: An optimal algorithm for finding compact sets

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