References
- Ahuja , R. K. , Mehlhorn , K. , Orlin , J. B. and Tarjan , R. E. (1990) . Faster algorithms for the shortest path problem . J. ACM , 37 : 213 – 223 .
- Chang , M. S. and Wang , F.-H. (1992) . Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs . Inf. Process. Lett. , 43 : 293 – 295 .
- Edmonds , J. and Karp , R. M. (1972) . Theoretical improvements in algorithmic efficiency for network flow problems . J. ACM , 19 : 248 – 264 .
- Garey M. R. Johnson D. S. Computer and Intractability: A Guide to the Theory of NP-Completeness Freeman San Francisco CA (1979)
- Golumbic M. C. Algorithmic Graph Theory and Perfect Graphs Academic Press New York (1980)
- Hsiao , J. Y. , Tang , C. Y. and Chang , R. S. (1991) . Solving the single step graph searching problem by solving the maximum two-independent set problem . Inf. Process. Lett. , 40 : 283 – 287 .
- Hsiao , J. Y. , Tang , C. Y. and Chang , R. S. (1992) . An efficient algorithm for finding a maximum weight 2-independent set on interval graphs . Inf. Process. Lett. , 43 : 229 – 235 .
- Hsu W. L. Tsai K. H. A linear time algorithm for the two-track assignment problem Proceedings of 27th Allerton Conf. on Communication, Control and Computing (1989) pp. 291–300
- Johnson , D. S. (1985) . The NP-Completeness Column: An on going guide . J. Algorithms , 6 : 434 – 451 .
- Kim , H. (1990) . Finding a maximum independent set in a permutation graph . Inf. Process. Lett. , 36 : 19 – 23 .
- Lou , R. D. , Sarrafgadeh , M. and Lee , D. T. (1992) . An optimal algorithm for the maximum two-chain problem . SIAM J. Discrete Math. , 5 : 285 – 304 .
- Pal , M. and Bhattacharjee , G. P. (1996) . A sequential algorithm for finding a maximum weight k-independent set on interval graphs . Intern. J. Comput. Math. , 60 : 205 – 214 .
- Pnueli , A. , Even , S. and Lempel , A. (1971) . Transitive orientation of graphs and identification of permutation graphs . Can. J. Math. , 23 : 160 – 175 .
- Sarrafgadeh , M. and Lee , D. T. (1989) . A new approach to topological via minimization . IEEE Trans. Computer Aided Design , 8 : 890 – 900 .
- Yannakakis , M. and Gavril , F. (1987) . The maximum k-colorable subgraph problem for chordal graphs . Inf. Process. Lett. , 24 : 133 – 137 .
- Yu , C.-W. and Chen , G.-H. (1992) . The weighted maximum independent set problem in permutation graphs . BIT , 32 : 609 – 618 .
- Yu , M. S. , Tseng , L. Y. and Chang , S.-J. (1993) . Sequential and parallel algorithms for the maximum weight independent set problem on permutation graphs . Inf. Process. Lett. , 46 : 7 – 11 .