Transitive Closure: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
V: number of vertices | $V$: number of vertices | ||
E: number of edges | $E$: number of edges | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 26: | Line 26: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Strongly Connected Components - Transitive Closure - Time.png|1000px]] | [[File:Strongly Connected Components - Transitive Closure - Time.png|1000px]] | ||
Latest revision as of 09:06, 28 April 2023
Description
In this problem, we also want to compute the transitive closure of a graph. (Perhaps this should be a separate problem?)
Related Problems
Related: Strongly Connected Components, Maximum Strongly Connected Component, Strong Connectivity (dynamic), 2 Strong Components (dynamic), Connected Subgraph
Parameters
$V$: number of vertices
$E$: number of edges
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Paul Purdom | 1970 | $O(V^{2}+VE)$ | $O(V^{2})$ | Exact | Deterministic | Time & Space |
Time Complexity Graph
Error creating thumbnail: Unable to save thumbnail to destination