tokens: For instance , the minimum spanning tree ( MST ) problem falls in this category , since we can easily solve its clustered version by first computing a MST of each cluster , then contracting these MSTs each to a vertex , and finally finding a MST of the resulting graph .