Author:
Pal Madhumangal,Pal Anita
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference58 articles.
1. Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM 37, 213–223 (1990)
2. Balas, E., Xue, J.: Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. SIAM J. Comput. 20, 209–221 (1991)
3. Bhattacharya, B.K., De, M., Nandy, S.C., Roy, S.: Maximum independent set for interval graphs and trees in space efficient models. In: 26th Canadian Conference on Computational Geometry, Halifax, Nova Scotia, August 1113 (2014)
4. Blöchliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comput. Oper. Res. 35(3), 960–975 (2008)
5. Bodlaender, H., Kloks, T.: A simple linear time algorithm for triangulating three-colored graphs. J. Algorithms 15, 160–172 (1993)