An Algorithm to Search Minimal Subtree Graphs

Abstract

In this paper, we first propose an algorithm to obtain multicast routing graph. The multicast routing algorithm with network coding will consume lesser resource, and is much closer to minimum-cost multicast. A scheme to search minimal subtree graph is presented based on the chosen routing graph. Moreover, upon the minimal subtree graph obtained, we can effectively construct network coding. Then all the network coding problems can be reduced to search the minimal subtree graphs.