Author:
Tu Chih-Chien,Cheng Hsuanjen
Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference27 articles.
1. Alizadeh, F., Haeberly, J. A. and Overton, M. L., A new primal-dual interior-point method for semidefinite programming. Technical Report 659. Computer Science Department, Courant Institute of Mathematical Sciences, New York University, U.S.A., 1994
2. An algorithm for partitioning the nodes of a graph;Barnes;SIAM Journal on Algebraic and Discrete Methods,1982
3. Bui, T. N., Leighton, F. T. and Heigham, C., Improving the performance of the kernighan-lin and simulated annealing graph bisection algorithms. Proceedings 26th IEEE Design Automation Conference. U.S.A., 1989, pp. 775–778
4. Barnes, E. R. and Hoffman, A. J., Partitioning, Spectra and Linear Programming. Academic Press, U.S.A., 1984
5. Boppana, R. B., Eigenvalues and graph bisection: An average case analysis. Proceedings of the 28th Annual Symposium on Computer Science, IEEE, 1987, pp. 280–285
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献