References
- Farley , A. and Proskurowski , A. 1980 . Computation of the center and diameter of Outerplanar graphs . Discrete Applied Math. , 2 : 185 – 191 .
- Goldman , A. J. 1972 . Minimax location of a facility in a network . Transportation Science , 6 : 407 – 418 .
- Chen , C. C.-Y. and Das , S. K. 1992 . Breadth-first traversal of trees and integer sorting in parallel . Infor. Proc. Lett. , 41 : 39 – 49 .
- Chen , C. C.-Y. , Das , S. K. and Akl , S. G. 1991 . A unified approach to parallel Depth-first traversals of general trees . Infor. Proc. Lett. , 38 : 49 – 55 .
- Roberts , F. S. 1978 . Graph Theory and its Application to Problems of Society , Philadelphia, , PA : SIAM .
- Ramalingam , G. and Pandu Rangan , C. 1988 . A unified approach to domination problems in interval graphs . Infor. Proc. Lett. , 27 : 271 – 274 .
- Golumbic , M. C. 1980 . Algorithmic Graph Theory and Perfect Graphs , New York : Academic Press .
- Pal , M. and Bhattacharjee , G. P. 1993 . In proceeding of 3rd National Seminar on Theoretical Computer Science . An optimal parallel algorithm to solve the all-pair shortest path problem on an interval graph . June 1993 , India. pp. 309 – 318 .
- Cole , R. 1988 . Parallel merge sort . SIAM J. Comput. , 17 : 770 – 785 .
- Ravi , R. , Marathe , M. V. and Pandu Rangan , C. 1992 . An optimal algorithm to solve the all-pair shortest path problem on an interval graphs . NETWORKS , 22 : 21 – 35 .
- Olariu , S. 1990 . A simple linear-time algorithm for computing the center of an interval graph . Intern. J. Computer Math. , 34 : 121 – 128 .
- Olariu , S. , Schwing , J. L. and Zhang , J. 1992 . Optimal parallel algorithms for problems modeled by a family of intervals . IEEE Trans. Parallel and Distributed Systems , 3 : 364 – 374 .