@article{ITA_1995__29_6_451_0, author = {Balayogan, V. B. and Pandu Rangan, C.}, title = {Parallel algorithms on interval graphs}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {451--470}, publisher = {EDP-Sciences}, volume = {29}, number = {6}, year = {1995}, mrnumber = {1377025}, zbl = {0881.68088}, language = {en}, url = {http://www.numdam.org/item/ITA_1995__29_6_451_0/} }
TY - JOUR AU - Balayogan, V. B. AU - Pandu Rangan, C. TI - Parallel algorithms on interval graphs JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1995 SP - 451 EP - 470 VL - 29 IS - 6 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1995__29_6_451_0/ LA - en ID - ITA_1995__29_6_451_0 ER -
%0 Journal Article %A Balayogan, V. B. %A Pandu Rangan, C. %T Parallel algorithms on interval graphs %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1995 %P 451-470 %V 29 %N 6 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1995__29_6_451_0/ %G en %F ITA_1995__29_6_451_0
Balayogan, V. B.; Pandu Rangan, C. Parallel algorithms on interval graphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 6, pp. 451-470. http://www.numdam.org/item/ITA_1995__29_6_451_0/
[BSV88] Some doubly logarithmic optimal algorithms based on nearest smallers, Research Report RC 14128 (#63291), IBM Research Division, Israel, 1988.
, and ,[BB87] Some parallel algorithms on interval graphs, Discrete Applied Mathematics, 1987, 16, pp. 101-111. | MR | Zbl
, and ,[C86] Parallel merge sort, Proc. 27th Annual Symposium on the Foundations of Computer Science, 1986, pp. 511-516.
,[GDSP90] Parallel algorithms on interval graphs, Volume 3 in the Proc. 1990 International Conference on Parallel Processing, 1990, pp. 72-75.
and , ,[G80] Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, USA, 1980. | MR | Zbl
,[K88] Efficient parallel algorithms on chordal graphs, Laboratory for Computer Science, MIT, USA, 1988. Also Appeared as Chapter 8 in [R93].
,[MJ88] Parallel algorithms for maximum matching and other problems on interval graphs, TR 88-927, Cornell University, Ithaca, USA, 1988.
and ,[RP88] A unified approach to domination problems on interval graphs, Information Processing Letters, 1988, 27, pp. 271-274. | MR | Zbl
and , ,[R85] Depth First Search is inherently sequential, Information Processing Letters, 1985, 20, pp. 229-234. | MR | Zbl
,[R93] Synthesis of Parallel Algorithms, Morgan Kaufmann, California, USA, 1993. | MR
,[R76] Discrete Mathematical Models with Applications to Social, Biological and Environmental problems, Prentice-Hall, Englewood Cliffs, New Jersey, USA, 1976. | Zbl
,[SW88] A parallel algorithm for channel routing, Proceedings of WG'88, Graph-theoretic Concepts in Computer Science (published as Lecture Notes in Computer Science, Springer-Verlag, New York, 1988). | MR
and ,[TC84] Efficient parallel algorithms for a class of graph theoretic problems, SIAM Journal of Computing, 1984, 13, pp. 580-599. | MR | Zbl
and ,[SG91] Efficient parallel Computation of Hamiltonian Paths and Circuits in Interval Graphs, Proc. Int. Conf. On Parallel Processing, Vol. 3, 1991, pp. 83-90.
and ,[K89] Optimal Parallel Algorithms on Sorted Intervals, Proc. 27th Annual Allerton Conf. on Comm., control and Computing, 1989, pp. 766-775.
,[OSZ90] Optimal Parallel Algorithms for Problems Modelled by a Family of Intervals, Proc. 28th Annual Allerton Conf. on Comm., Control and Computing, 1990, pp. 282-291.
, and ,[SK91] Optimal Parallel algorithms for finding the Cut vertices and Bridges of Interval graphs, Technical report, University of Alabama, USA, June, 1991. | MR
and ,[DC92] Efficient Parallel Algorithms on Interval graphs, Technical report, Department of Computer science, University of North texas, USA, 1992. | MR
and ,[JJ92] An Introduction to Parallel Algorithms, Addison Wesley, USA, 1992. | Zbl
,