An efficiently solvable case of the minimum weight equivalent subgraph problem
暂无分享,去创建一个
[1] Nobuji Saito,et al. Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.
[2] Sartaj Sahni,et al. Computationally Related Problems , 1974, SIAM J. Comput..
[3] Charles J. Colbourn,et al. Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.
[4] S. Martello,et al. Finding a minimum equivalent graph of a digraph , 1982, Networks.
[5] Gerald L. Thompson,et al. An Algorithm for Finding a Minimum Equivalent Graph of a Digraph , 1969, J. ACM.
[6] R. Duffin. Topology of series-parallel networks , 1965 .