Exhaustive search (Minimum Wiener Connector problem Wiener Index)
Jump to navigation
Jump to search
Time Complexity
{2}^($O(n)$)
Space Complexity
$O(n)$ auxiliary words
(Keeps track of current subset being checked, minimum subset, and O(1) Wiener indices)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2015