Author:
Hsieh Sun-Yuan,Ho Chin-Wen
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. M. W. Bern, E. L. Lawler, and A. L. Wong, “Linear-time computation of optimal subgraphs of decomposable graphs”, J. Algorithms 8, No.2 (1987), pp. 216–235.
2. H. Cormen, E. Leiserson and L. Rivest, “Introduction to Algorithms”, McGraw-Hill, New York, 1992, pp.709–713.
3. R. J. Duffin, “Topology of series parallel networks”, J. Math. Anal. Appl. 10 (1965), pp. 303–318.
4. D. Fussell, V. Ramachandran, and R. Thurimella, “Finding triconnected components by local replacement”, SIAM J. Comput. 22, No.3 (1993), pp. 587–616.
5. T. Hagerup, “Towards optimal parallel bucket sorting”, Inform. Comput., 75 (1987), pp. 39–51.