Skip to main content
. Author manuscript; available in PMC: 2021 Jan 1.
Published in final edited form as: J Comput Graph Stat. 2019 Jul 19;29(1):87–96. doi: 10.1080/10618600.2019.1629943

Fig. 3.

Fig. 3

Time required to compute clustering solution path (logarithmic scale). carp produces high-quality path approximations in a fraction of the time of standard iterative algorithms. Timings in black indicate calculations that took more than 24 hours to complete.