Publisher
Zhejiang University Press
Reference13 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D., 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA.
2. Atallah, M.J., Chen, D.Z., 1989. An optimal parallel algorithm for the minimum circle cover problem. Information Processing Letters, 32:159–165.
3. Bertossi, A.A., 1988. Parallel circle cover algorithms. Information Processing Letters, 27:133–139.
4. Booth, K.S., Luckher, G.S., 1976. Testing for the consecutive ones properly, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335–379.
5. Chen, D.Z., Lee, D.T., 1994. Solving the All Pair Shortest-path Problem on Interval and Circular-arc Graphs. Proceedings of the 8th International Parallel Processing Symposium, Cancun, Mexico, p.224–228.