4Mokhtar A, Azizogou M. Adaptive wavelength routing in all -optical networks [J]. IEEE/ACM Trans. on Networking, 1998,6(2) : 197 - 206.
5Alanyali M, Ayanoglu E. Provisioning algorithms for WDM optical networks [J]. IEEE/ACM Trans. on Networking, 1999,7(5) :767 - 778.
6Aho A V, Hopcroft J E and Ullman J D. The Design and analysis of computer algorithms[M]. Addison Wesley, Reading, Massachusetts, 1974, 124-147.
7Booth K S and Lueker G S. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ tree algorithms[J]. Journal of Computer and System Sciences, 1976,13:335-379.
8Golumhie M C. Algorithmic graph theory and perfect graphs[M]. Academic Press, New York, 1980.
9Gupta U I, Lee D T and Leung J Y T. Efficient algorithms for interval graphs and circular arc graphs[M]. Networks, 1982,12:459-467.
10Tarjan R E. A class of algorithms which require nonlinear time to maintain disjoint sets[J]. Journal of Computer and System Sciences, 1979,18(2) :110-127.
