Refereed Publications

---

Journal Publications

1. W. Liang, R. Brent, Y. Xu, and Q. Wang.
   Minimum-energy all-to-all multicasting in wireless ad hoc networks.
   To appear in IEEE Transactions on Wireless Communications, Vol.XX, pp.XXX--XXX, 2009.[PDF].

2. Y. Liu and W. Liang.
   Online multicasting in WDM network with shared splitter bank.
   Photonic Network Communications, Vol.17, pp.1--9, Springer, 2009. [PDF]

3. X. Shen, J. Lou, W. Liang, and J Luo.
   Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches.
   Theoretical Computer Sciences, Vol.409, pp.477-485, Elsiver, Dec., 2008. [PDF]

4. H-C Liu, J. X. Yu and W. Liang.
   Safety, domain independence and translation of complex value database queries.
   Information Sciences , Vol. 178, No. 12, pp.2507-2533, June, 2008. [PDF].

5. Z. Tu and W. Liang.
   Energy-efficient aggregate query evaluation in wireless sensor networks.
   International Journal of Ad Hoc & Sensor Wireless Networks , Vol. 3, No. 1, Januray, 2007. [PDF].

6. W. Liang and Y. Liu.
   On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks.
   Ad Hoc Networks Journal , Vol. 5, No.2, pp. 272--285, March, Elsevier, 2007. [PDF].

7. W. Liang and Y. Liu.
   On-line data gathering for maximinizing network lifetime in sensor networks.
   IEEE Trans. Mobile Computing, Vol.6, No.1, pp.2--11, January, 2007. [PDF].

8. X. Zhang, W. Liang and H. Jiang.
   Flow equivalent trees in undirected node-edge-capacitated planar graphs.
   Inform. Proc. Lett., Vol. 100, pp.110--115, Nov., 2006. [PDF].

9. W. Liang and X. Guo.
   On-line multicasting for network capacity maximization in energy-constrained ad hoc networks.
   IEEE Transactions on Mobile Computing , Vol.5, No. 9, Sept, pp.1215--1227, 2006.[PDF].

10. W. Liang and X. Shen.
    A general approach for all-to-all routing in multihop WDM optical networks.
    ACM/IEEE Trans. Networking , Vol.14, pp.914--923, Aug., 2006. [PDF].

11. W. Liang.
    Approximate minimum-energy multicasting in wireless ad hoc networks.
    IEEE Transactions on Mobile Computing , Vol. 5, No. 4, pp. 377-387,2006.[PDF].

12. A. Vishwanath and W. Liang.
    On-line routing in WDM-TDM switched optical mesh networks.
    Photonic Network Communications , Vol.11, pp286-299, Springer, 2006.[PDF]

13. W. Liang and X. Shen
    Finding multiple routing paths in wide-area WDM networks.
    Computer Communications, Vol 28, pp. 811--818, 2005, [PDF] .

14. Y. Wan and W. Liang.
    On the minimum number of wavelengths in multicast trees in WDM networks.
    Networks, An International Journal ,Vol 45, pp.42--48, 2005.[PDF].

15. Y. Yang and W. Liang.
    The minimum number of vertics with girth 6 and degree set D={r,m}.
    Discrete Mathematics , Vol 28, pp. 249--258, 2003.[PDF].

16. W. Liang and J. X. Yu.
    Parallel maintenance of materialized views on personal computer clusters.
    International Journal of Parallel and Distributed Systems and Networks , ACTA Press, Vol 5, pp. 147--154, 2002,[PDF] (invited paper).

17. W. Liang and X. Shen.
    Permutation routing in all-optical product networks.
    IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, Vol.49, 533--538, Apr., 2002, [PDF].

18. W. Liang, R. P. Brent and H. Shen.
    Fully dynamic maintenance of k-connectivity in parallel.
    IEEE Trans. Parallel and Distributed Systems, Vol.12, 846--864, Aug., 2001, [PDF].

19. W. Liang.
    Finding the k most vital edges with respect to minimum spanning trees for fixed k.
    Discrete Applied Mathematics, Vol.113, 319--327,2001, [PDF].

20. W. Liang, H. Wang, and M. Orlowska.
    Materialized view selection under the maintenance time constraint.
    Data and Knowledge Engineering, Vol.37, 203--216, 2001, [PDF].

21. Y. Han, W. Liang, and X. Shen.
    Very fast parallel algorithms for approximate edge colouring.
    Discrete Applied Mathematics, Vol.108, 227--238, 2001, [PDF].

22. W. Liang, X. Shen and Qing Hu.
    Finding the most vital edge for graph minimization problems on meshes and hypercubes.
    International Journal of Parallel and Distributed Systems and Networks, Vol.3, No 4, 197--205, ACTA Press, 2000, [PDF] .

23. W. Liang and X. Shen.
    Improved lightpath (wavelength) routing in large WDM networks.
    IEEE Transactions on Communications, Vol. 48, No. 9, 1571--1579, 2000, [PDF], Slides.

24. W. Liang, H. Wang, and M. Orlowska.
    Range sum queries in dynamic OLAP data cubes.
    Data and Knowledge Engineering, Vol. 34, No. 1, 21--38, 2000, [PDF].

25. W. Liang and M. Orlowska.
    Computing multidimensional aggregates in parallel.
    Informatica, An International Journal of Computing and Informatics, Vol. 24, No. 1, 107--115, 2000, [PS].

26. W. Liang, M. Orlowska, and J. X. Yu.
    Optimizing multiple dimensional queries simultaneously in multidimensional databases.
    VLDB Journal, Vol. 8, No. 3/4, 319--338. 2000, [PDF].

27. W. Liang, H. Li, H. Wang and M. Orlowska.
    Making multiple views self-maintainable in a data warehouse.
    Data and Knowledge Engineering, Vol. 30, 121--134, 1999, [PDF].

28. W. Liang, G. Havas, and A. Street.
    Finding a low-diameter and low-weight k-connected subgraph.
    Congressus Numerantium, Vol. 136, 161--175, Dec., 1999, [PS] .

29. W. Liang and H. Shen.
    Multicast in large WDM networks.
    Parallel and Distributed Computing Practices, Vol. 2, 315--322, Nov., 1999, [PS] and [DVI].

30. H. Shen, W. Liang and J. Ng.
    Efficient computation of frequent itemsets in a subcollection of multiple set families.
    Informatica, An International Journal of Computing and Informatics, Vol. 23, No. 4, 543--548, 1999, [PS].

31. H. Shen, D. Evans, W. Liang and Y. Wang.
    Multiple multicasting in wide-area fiber-optic networks.
    IEICE Transactions on Information and Systems, Vol. E82-D, No. 6, 1074--1078, 1999, [PDF].

32. X. Shen, W. Liang and Q. Hu.
    Embedding between 2-D meshes of the same size.
    IEEE Transactions on Computers, Vol. 46, 880--889, Aug., 1997, [PDF].

33. H. Shen and W. Liang.
    Efficient enumeration of all minimal separators in a graph.
    Theoretical Computer Sciences, Vol. 180, 169--180, July, 1997, [PDF].

34. W. Liang and X. Shen.
    Finding the k most vital edges in the minimum spanning tree problem
    Parallel Computing, Vol. 23, 1889--1907, Dec., 1997, [PDF].

35. W. Liang, B. McKay and H. Shen.
    NC algorithms for dynamically solving the all pairs shortest paths problem and related problems.
    Information Processing Letters, Vol. 58, 149--155, May, 1996, [PDF].

36. Q. Hu, X. Shen and W. Liang.
    Optimally routing LC permutations on k-extra-stage Cube-type Networks.
    IEEE Transaction on Computers, Vol. 45, 97--103, January, 1996, [PDF].

37. W. Liang, X. Shen and Q. Hu.
    Parallel algorithms for the edge-colouring and the edge-coloring update problems.
    Journal of Parallel and Distributed Computing, Vol. 32, 66--73, 1996, [PDF].

38. W. Liang
    An NC algorithm for the approximate edge-coloring problem.
    Information Processing Letters, Vol. 55, 333--338, 1995, [PDF].

39. X. Shen, Q. Hu and W. Liang.
    Embedding K-ary complete trees into hypercubes.
    Journal of Parallel and Distributed Computing, Vol. 24, 100--106, 1995, [PDF].

40. X. Shen, Q. Hu and W. Liang.
    Realization of an arbitrary permutation on a hypercube.
    Information Processing Letters, Vol. 51, 237--243, 1994.

---

Conference Publications

1. B. Chen, W. Liang, and J. X. Yu.
   Energy-efficient skyline query processing and maintenance in sensor networks.
   To appear in Proc. 18th Conference on Information and Knowledge Management, Hong Kong, ACM Press, short paper, pp.XX-XX, 2009. [PDF]

2. W. Liang, G. Ma. Y. Xu, and J. Shi.
   Aggregate node placements in sensor networks.
   Proc. 11th IEEE Intl Conference on Communications Systems, IEEE Communication Society, pp926--932,2008. [PDF]

3. W. Liang, B. Chen, and J. X. Yu.
   Response time constrained top-k query evaluation in sensor networks.
   Proc. 14th IEEE Conference on Parallel and Distributed Systems, IEEE Computer Society, 2008. [PDF]

4. W. Liang, B. Chen, and J. X. Yu.
   Energy-efficient skyline query processing and maintenance in sensor networks.
   Proc. 17th Conference on Information and Knowledge Management, ACM Press, poster paper, pp1471--1472, 2008. [PDF]

5. Y. Liu and W. Liang.
   Prolonging network lifetime for target coverage in sensor networks.
   Proc. of 5th International Conference on Wireless Algorithms, Systems and Applications , Vol.5258, Lecture Notes in Computer Science,pp.212--223, 2008 [PDF]

6. Y. Liu and W. Liang.
   Snapshot-based query evaluation in sensor networks.
   To appear in Proc. 3rd Intl Conf. on Pervasive Computing and Applications ,IEEE Computer Society, 2008.

7. X. Zhang, W. Liang and G. Chen.
   Computing maximum flows in undirected planar networks with both edge and vertex capacities.
   Proc. of 14th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science, Vol. 5092, pp. 577--582, 2008. [PDF]

8. Y. Liu and W. Liang.
   Energy-efficient multiple routing trees for aggregate query evaluation in sensor networks.
   Proc. of 6th International Conference on Wired/Wireless Internet Communications, Lecture Notes in Computer Science, Vol. 5031, pp. 201--212,2008. [PDF]

9. W. Liang and Y. Liu.
   Online broadcasting and multicasting in WDM networks with shared light splitter bank.
   in Proc. of 4th Intl Conf on Broadband Communications, Networks, and Systems, IEEE Communication Society, Taleigh, North Carolina, USA, Sep. 10-14, 2007.[PDF]

10. Y. Liu and W. Liang.
    Online multicasting in WDM networks with shared light splitter bank.
    Proc. of IFIP Networking, Lecture Notes in Computer Science, Vol 4479, pp. 958--970, 2007. [PDF]

11. A. Vishwanath and W. Liang.
    Delay constrained traffic grooming in WDM ring networks. Proc. of 31st Annu. IEEE Conf. on Local Computer Networks , IEEE Computer Society, pp. 443--450, 2006.[PDF]

12. Z. Tu and W. Liang.
    Energy-efficient aggregate query evalution in sensor networks.
    Proc of Int'l Conf. on Mobile Ad Hoc and Sensor Networks , Lecture Notes in Computer Science, Vol. 3794, pp.31--41, Wuhan, Dec., 1-4 2005. [PDF]

13. A. Vishwanath and W. Liang.
    On-line routing in WDM-TDM switched optical mesh networks. The 6th Int'l Conf. on Parallel and Distributed Computing, Applications and Technologies , IEEE Computer Society, Dalian, China, 5-8 Dec. 2005.[PDF]

14. Y. Liu and W. Liang.
    Approximate coverage in sensor networks. Proc. of 30th Annu. IEEE Conf. on Local Computer Networks , IEEE Computer Society, pp. 68-75, Sydney, November, 15-17, 2005.[PDF]

15. A. Vishwanath and W. Liang.
    On-line multicast routing in WDM grooming networks. Proc. of 14th Int'l Conf. on Computer Communication and Networks, San Diego, CA, October 17-19, IEEE Computer Society, pp.255--260,2005.[PDF]

16. W. Liang.
    Minimizing energy and maximizing network lifetime multicasting in wireless ad hoc networks. Proc. of 40th Int'l Conf. on Communications (ICC'05, Wireless Networking) , IEEE Communication Society, Seoul, May, vol.5, pp.3375--3379, 2005.[PDF][slides].

17. Y. Wan and W. Liang.
    Wavelength rerouting in survivable WDM networks. Proc. of IFIP Networking , Lecture Notes in Computer Science, Vol 3462, pp. 431 -- 442, Waterloo, Ontario, Canada, May 2-6, 2005. [PDF].

18. W. Liang, Y. Liu and X. Guo.
    On-line disjoint path routing for network capacity maximization in ad hoc networks. Proc. of IEEE Wireless Communications and Networking Conf. , IEEE Communication Society, New Orleans, March, Vol. 4, pp. 2026--2031, 2005. [PDF].

19. Y. Wan and W. Liang.
    Wavelength rerouting for on-line multicast in WDM networks. Proc. of 29th Annu. IEEE Conf. on Local Computer Networks, IEEE Computer Society, pp. 352--359,Tampa, FL, November 2004.[PDF].

20. A. Vishwanath and W. Liang.
    Multiple end-to-end delay constrained multicasting in multi-hop optical WDM networks. Proc. of 9th Intl' Conf. on Communication Systems , IEEE Computer Society, Sigopare, Sept., 2004.[PDF].

21. W. Liang.
    Constructing multiple light multicast trees in WDM optical networks. Proc. of 7th Int'l Symp. on Parallel Architectures, Algorithms, and Networks , IEEE Computer Society, Hong Kong, May 10-12, 2004.[PDF].

22. H.C. Liu and W. Liang.
    Safe web queries. Proc of Asian-Pacific Web Conf. in 2004 , Lecture Notes in Computer Science, April, 2004.[PDF].

23. W. Liang and Y. Yang.
    Maximizing battery life routing in wireless ad hoc networks. Proc of 37th Hawaii Int'l Conf on System Sciences , IEEE Computer Society, January, 2004, [PDF].

24. W. Liang and J. X. Yu.
    Parallel maintenance of materialized views on personal computer clusters.
    Proc. 13th Int'l Conf. on Parallel and Distributed Computing and Systems, IASTED/ACTA Press, 2002, [PDF].

25. W. Liang and X. Shen
    Finding multiple routing paths in wide-area WDM networks.
    Workshop on Optical Networks, in conjunction with ICPP 2002 , Vancouver, Canada, August, IEEE Computer Society, pp. 199--206, 2002, [PS] .

26. W. Liang
    Constructing minimum-energy broadcast trees in wireless ad hoc networks.
    Proc. of 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, ACM Press, Lausanne, Switzerland, June, pp. 112-122,2002, [PDF]

27. W. Liang and J. X. Yu.
    Revisit on view maintenance in data warehouses.
    Proc of 2nd Int'l Conf. on Web-Age Information Management, Xi'an, July, Lecture Notes in Computer Science, Vol. 2118, Springer, pp.203--211, 2001, [PDF].

28. W. Liang.
    Robust routing in wide-area WDM networks.
    Proc. of 15th Int'l Parallel and Distributed Processing Symp., San Francisco, April, IEEE Computer Society, 2001, [PDF].

29. W. Liang, C. Johnson and J. X. Yu.
    Maintaining materialised views for data warehouses with the multiple remote source environments.
    Proc of 1st Int'l Conf. on Web-Age Information Management
    Shanghai, Lecture Notes in Computer Science, Vol. 1846, Springer, pp.299--310, 2000, [PDF].

30. W. Liang and M. Orlowska.
    Optimizing processing of query subscription in an WDM network environment.
    Proc of Int'l Symp. on Information Technology: Coding and Computing, IEEE Computer Society Press, pp.510--515, 2000,[PS].

31. H. Wang, M. Orlowska and W. Liang.
    Efficient refreshment of materialised views with multiple sources.
    Proc of 8th Annual Conf. on Information and Knowledge Managements , Nov., USA, ACM Press, pp.375--382, 1999, [PDF].

32. W. Liang and B. McKay.
    An NC approximation algorithm for optimal k-edge connectivity augmentation.
    Proc. of Int'l Symp.. on Parallel Architectures, Algorithms, and Networks,
    Perth, June, IEEE Computer Society Press, pp.290--295, 1999, [PS].

33. W. Liang and X. Shen.
    Permutation routing in all-optical product networks.
    Proc. of 3rd Workshop on Optics and Computer Science,
    San Juan, Puerto Rico, April, Lecture Notes in Computer Science, Vol. 1586, Springer, pp. 831--844, 1999, [PS].

34. W. Liang and M. Orlowska.
    Computing multidimensional aggregate in parallel.
    Proc. of Int'l Conf. on Parallel and Distributed Systems, Taiwan, Dec. 14-16, IEEE Computer Society Press, 1998,[PS].

35. W. Liang, M. Orlowska, and H. Shen.
    Simultaneous optimization and evaluation of multiple dimensional aggregate queries on shared-nothing multiprocessors.
    Proc. of 2nd ISATED Int'l Conf. of Parallel and Distributed Computing and Networks,
    Brisbane, Dec., pp.48-53, ACTA Press, 1998, [PS].

36. W. Liang, Q. Hu and X. Shen.
    Finding the most vital edge for some optimisation problems on meshes and hypercubes.
    Proc. 10th Int'l Conf. on Parallel and Distributed Computing and Systems, IASTED, Los Vegas, Oct., pp. 14--19, IASTED/ACTA Press, 1998, .

37. Y. Han, W. Liang, and X. Shen.
    Very fast parallel algorithms for approximate edge colouring.
    Proc. 10th Int'l Conf. on Parallel and Distributed Computing and Systems, IASTED, Los Vegas, Oct., pp. 244--249, IASTED/ACTA Press, 1998.

38. H. Shen and W. Liang.
    Efficient multiple multicast in WDM networks.
    Proc. of 1998 Int'l Conf. on Parallel and Distributed Techniques and Applications,
    Los Vegas, CSREA Press, July, Vol.2, pp.1028--1033, ISBN: 1-892-512-05-x, 1998.

39. W. Liang, G. Havas and X. Shen.
    Improved lightpath routing in large WDM networks.
    Proc. of 18th Int'l Conf. on Distributed Computing Systems,
    Amsterdam, The Netherlands, IEEE Computer Society Press, May 26--29, pp.516--523, 1998.

40. W. Liang and H. Shen.
    Multicast broadcasting in large WDM networks.
    Proc. 12th International Parallel Processing Symposium,
    Orlando, Florida, USA, IEEE Computer Society Press, pp.365--369, March 30-April 3, 1998.

41. W. Liang and G. Havas.
    Finding the k most vital edges with respect to minimum spanning trees with k=2,3.
    Proc. of CATS'98, Computing Theory, Ed. X. Lin, Perth, Feb., pp. 37--50, Springer, 1998.

42. W. Liang, G. Havas and A. Street.
    Parallel approximate edge colouring revisited.
    Proc. 4th Australasian Conf. on Parallel and Real-time Systems, Eds. N. Sharda and A. Tam, Springer, Sept., pp.95--103, 1997.

43. W. Liang and G. Havas.
    NC approximation algorithms for the 2-connectivity augmentation in a graph.
    Proc. of Euro-Par'97, Lecture Notes in Computer Science, Vol. 1300, pp. 430--439, Germany, Springer, Aug., 1997

44. W. Liang.
    An NC algorithm for the nearest common dominator problem and related problems in a DAG.
    Australian Computer Science Communications Vol. 20, ({\it Proc. 20th Australasian Computer Science Conference}), pp.79-82, 1997.

45. W. Liang and R. Brent.
    Constructing the spanners of graphs in parallel.
    Proc. the 10th International Parallel Processing Symposium.
    IEEE Computer Society Press, IEEE & ACM SIGARCH, Honolulu, Hawaii, April, pp. 206-210, 1996.

46. B. B. Zhou, R. Brent, X. Qu and W. Liang.
    A novel parallel algorithm for enumerating combinations.
    Proc. of 1996 International Conf. on Parallel Processing, Vol II, pp. 70-73, IEEE Computer Society Press, Aug., 1996.

47. W. Liang and B. McKay.
    A fast parallel algorithm for computing maximal interlocking sets.
    Accepted by IEEE 2nd International Conf. on Algorithms and Architectures for Parallel Processing .
    Singapore, June, 1996.

48. W. Liang and H. Shen.
    Fully dynamic maintaining 2-edge connectivity in parallel.
    Proc. of 7th IEEE Sympo. on Parallel and Distributed Processing.
    IEEE Computer Society Press, Oct., San Antonio, Texas, Oct., 25-28, pp.216-223, 1995.

49. W. Liang and B. McKay.
    Fast parallel algorithms for testing k-connectivity of directed and undirected graphs.
    Proc. of IEEE the first International Conf. on Algorithms and Architectures for Parallel Processing .
    IEEE Press, Brisbane, Australia, April, pp.437-441, 1995.

50. W. Liang and X. Shen.
    Fast sequential and parallel algorithms for finding the longest subsequence or the maximum weighted subsequence.
    Proc. of 4th Int'l Conf. for Young Computer Scientists, Peking University Press, Beijing, July, pp.656-661, 1995.

51. W. Liang, X. Shen and Q. Hu.
    Parallel algorithms for verification and sensitivity analysis of minimum spanning trees.
    Proc. of International Conf. on Parallel and Distributed Systems.
    IEEE Computer Society Press, Dec., Taiwan, pp.310-315, 1994.

52. X. Shen, Q. Hu and W. Liang
    Efficient embedding K-ary complete tree into hypercubes.
    Proc. the 8th International Parallel Processing Symposium.
    IEEE Computer Society Press, IEEE & ACM SIGARCH, Mexico, 1994.

53. X. Shen and W. Liang
    A parallel algorithm for multiple edge updates of minimum spanning trees.
    Proc. the 7th International Parallel Processing Symposium .
    IEEE Computer Society Press, IEEE & ACM SIGARCH, CA, April, pp.310-317, 1993.

54. X. Shen, W. Liang and Q. Hu.
    Embedding between 2-D meshes of the same size.
    Proc. the 5th IEEE Sympo. on Parallel and Distributed Processing.
    IEEE Computer Society Press, Dec. 1-4, Dallas, pp.712-719, 1993.

55. W. Liang and X. Shen.
    A distributed algorithm for topological sorting.
    Proc. the 1st Int'l Conf. on Computer Communications and Networks, ISMM, San Diego, CA., June, pp.261-264, 1992.

56. W. Liang and X. Shen.
    Linked list prefix computation on mesh arrays.
    Proc. the 2nd Int'l Computer Sci. Conf., IEEE, Hong Kong, Dec., pp.183-188, 1992.

57. W. Liang and C. Tang.
    Two distributed algorithms for maximum matchings in bipartite graphs.
    Proc. of 2nd Int'l Conf. for Young Computer Scientists, International Academic Publishers, Beijing, July, pp.206-210, 1991.

---

Chinese Journal Publications

1. G. Chen, W. Liang and H. Shen.
   Research advances in parallel graph algorithms.
   Computer Research and Development, Vol. 32, No. 9, 1-16, 1995.

2. C. Tang and W. Liang.
   A parallel algorithm for computing connected-components of graphs.
   Chinese Journal of Software, Vol. 4, No. 4, 61--68, 1993.

3. W. Liang and C. Tang.
   A parallel algorithm for the minimum spanning tree on mesh arrays.
   Chinese Journal of Computers, Vol. 15, No. 2, Feb., 420--425, 1992.

4. W. Liang and C. Tang.
   A distributed algorithm for topological sorting.
   Computer Research and Development, Vol. 29, No. 9, Sept., 1992.

5. W. Liang and C. Chen.
   Some optimal algorithms for graphs on hypercube multicomputers.
   Chinese Journal of Computers, Vol. 14, No. 9, Sept., pp.641-650, 1991.

6. C. Tang and W. Liang.
   A parallel algorithm for finding K minimum spanning trees.
   University Journal of Science & Technology of China, Vol. 20, No. 4, 464--470, 1991.

7. W. Liang and C. Tang.
   Distributed algorithms for maximum matching in bipartite graphs.
   Computer Engineering and Applications, No.10-11, 48--53, 1990.

8. C. Tang and W. Liang.
   Design parallel algorithms using divide-and-conquer strategy.
   Micoroelectronica and Computer, Vol. 7, 17--20, 1990.

9. C. Tang and W. Liang.
   Some efficient parallel algorithms on interval graphs.
   Applied Mathematics Journal of Chinese Universities, Vol. 4, 534--539, 1989.

______________________ END__________________