An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph
- 30 June 2000
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 74 (5-6) , 215-220
- https://doi.org/10.1016/s0020-0190(00)00064-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Similarity relations, fuzzy linear orders, and fuzzy partial ordersFuzzy Sets and Systems, 2000
- The min-max composition rule and its superiority over the usual max-min composition ruleFuzzy Sets and Systems, 1998
- An optimal algorithm for finding compact setsInformation Processing Letters, 1992
- A fast algorithm for finding the compact setsInformation Processing Letters, 1991