Pages that link to "Item:Q1209360"
From MaRDI portal
The following pages link to An optimal algorithm for finding compact sets (Q1209360):
Displaying 7 items.
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772) (← links)
- A fast algorithm for finding the compact sets (Q1178253) (← links)
- A fast algorithm for finding interlocking sets (Q1263973) (← links)
- A note on finding compact sets in graphs represented by an adjacency list (Q1351637) (← links)
- An optimal algorithm for finding all convex subsets in tournaments (Q2760997) (← links)
- Efficient algorithms to decide tightness (Q3132845) (← links)
- (Q3320385) (← links)