國立臺灣大學資訊工程學系Pettie, SethSethPettieRamachadran, VijayaVijayaRamachadran2006-09-282018-07-052006-09-282018-07-052002-01http://ntur.lib.ntu.edu.tw//handle/246246/2006092815521399Precompute the optimal decision trees for all graphs with ≤ log(3) n vertices. Partition the original graph into small subgraphs : soft heap. Find the MST of each subgraph :decision tree. Use the small MSTs to construct the MST of the original graph dense caseapplication/ppt409088 bytesapplication/vnd.ms-powerpointzh-TWSpanning Treealgorithmjournal articlehttp://ntur.lib.ntu.edu.tw/bitstream/246246/2006092815521399/1/mst2.ppt