Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

2001

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Linda_G._Shapiro_and_George_C._Stockman_(2001)_(_Image_Segmentation)&oldid=44742"