sentence1: as shown in , it is possible to reduce the mst problem of an input graph , to two instances of mst on graphs with oedges .
sentence2: the mst problem for a given graph can be reduced , by using the kkt random sampling to two consecutive instances of mst , each for a graph with oedges .