An optimal algorithm for finding compact sets

DOI10.1016/0020-0190(92)90215-HzbMATH Open0768.68039MaRDI QIDQ1209360FDOQ1209360

Authors: Eliezer Dekel, Jie Hu, Wen Ouyang 

Publication date: 16 May 1993

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

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

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)

Cites Work

• Title not available (Why is that?)
• A fast algorithm for finding the compact sets
• Title not available (Why is that?)

Cited In (8)

• An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
• Title not available (Why is that?)
• An optimal algorithm for finding all convex subsets in tournaments
• Efficient algorithms to decide tightness
• A fast algorithm for finding the compact sets
• A fast algorithm for finding interlocking sets
• A note on finding compact sets in graphs represented by an adjacency list
• Title not available (Why is that?)

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)