References

Chung, M.J., F. Makedon, I.H. Sudborough and J. Turner, 1982. Polynomial time algorithms for the min cut problem on degree restricted trees. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, November 03-05, 1982, ACM, Washington, DC, USA., pp: 262-271.

Feo, T.A., M.G. Resende and S.H. Smith, 1994. A greedy randomized adaptive search procedure for maximum independent set. Oper. Res., 42: 860-878.
Direct Link  |  

Harper, L.H., 1966. Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory, 1: 385-393.
Direct Link  |  

Luttamaguzi, J., M. Pelsmajer, Z. Shen and B. Yang, 2005. Integer programming solutions for several optimization problems in graph theory. Proceedings of the 20th International Conference on Computers and their Applications (CATA 2005), March 16-18, 2005, ISCA, New Orleans, Louisiana, pp: 1-1.

Makedon, F.S., C.H. Papadimitriou and I.H. Sudborough, 1985. Topological bandwidth. SIAM. J. Algebraic Discrete Methods, 6: 418-444.
Direct Link  |  

Thilikos, D.M., M.J. Serna and H.L. Bodlaender, 2001. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. Proceedings of the 9th Annual European Symposium on Algorithms, August 28-31, 2001, Springer, Berlin, Germany, pp: 380-390.

Yannakakis, M., 1985. A polynomial algorithm for the min-cut linear arrangement of trees. J. ACM., 32: 950-988.
Direct Link  |