Combinatorial problems on series-parallel graphs
暂无分享,去创建一个
Abstract This paper outlines the results and motivation of the paper [1], in which we showed, in a unified manner, that there exist linear time algorithms for many combinatorial problems defined on the class of series-parallel graphs.
[1] Nobuji Saito,et al. Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.