Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
暂无分享,去创建一个
[1] C. P. Rangan,et al. A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..
[2] Stephan Olariu,et al. Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals , 1992, IEEE Trans. Parallel Distributed Syst..
[3] Arthur M. Farley,et al. Computation of the center and diameter of outerplanar graphs , 1980, Discret. Appl. Math..
[4] Stephan Olariu,et al. A simple linear-time algorithm for computing the center of an interval graph , 1990, Int. J. Comput. Math..
[5] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[6] A. J. Goldman. Minimax Location of a Facility in a Network , 1972 .
[7] C. Pandu Rangan,et al. An optimal algorithm to solve the all-pair shortest path problem on interval graphs , 1992, Networks.
[8] Selim G. Akl,et al. A Unified Approach to Parallel Depth-First Traversals of General Trees , 1991, Inf. Process. Lett..
[9] Sajal K. Das,et al. Breadth-First Traversal of Trees and Integer Sorting in Parallel , 1992, ICPP.
[10] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).