An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal O(N^2) algorithm for computing the min-transitive closure of a weighted graph |
scientific article; zbMATH DE number 6594098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph |
scientific article; zbMATH DE number 6594098 |
Statements
An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (English)
0 references
16 June 2016
0 references
min-transitivity
0 references
similarity relation
0 references
depth-first search
0 references
weighted graph
0 references
0 references
0.7675996422767639
0 references
0.760334849357605
0 references
0.7600626349449158
0 references
0.7600626349449158
0 references
0.7429022789001465
0 references
