期刊文献+

谱划分算法中特征向量选取方法的研究

原文传递
导出
摘要 图的划分是一个NP难问题,目前已经有很多关于这方面的新算法和文献已经发表,其中的差别主要是在特征向量的选择上。本文主要研究谱划分算法中特征向量的选取问题,从而说明对于具有不同规模和结构的图,应该如何有效的选择合适的特征向量进行划分。我们通过两个方法来讨论这个问题:(1)Fiedler特征向量;(2)前个特征向量。最后通过仿真实验来说明使用不同的特征向量选择方法进行划分时的优点和缺点,以及不同方法适用的领域。
作者 杨常清 高尧
出处 《信息与电脑(理论版)》 2011年第8期127-128,共2页 China Computer & Communication
  • 相关文献

参考文献6

  • 1徐大川,韩继业,杜东雷.关于图划分问题的改进的近似算法[J].应用数学学报,2005,28(4):587-597. 被引量:4
  • 2M.Meila,J.Shi.Learning segmentation by random walks. Advances in Neural Information Processing Systems . 2000
  • 3Y. Weiss.Segmentation using eigenvectors: a unifying view. IEEE International Conference on Computer Vision . 1999
  • 4Newman M E J.Finding community structure in net-works using the eigenvectors of matrices. Physical Review E Statistical Nonlinear and Soft Matter Physics . 2006
  • 5Spielman D,Teng S.Spectral partitioning works: planar graphs and finite element meshes. 37th Annual Symposium on Foundations of Computer Science . 1996
  • 6Newman,MEJ.Fast algorithm for detecting community structure in networks. Physical Review E Statistical, Nonlinear and Soft Matter Physics . 2004

二级参考文献14

  • 1Papadimitriou C H, Yannakakis M. Optimization, Approximation, and Complexity Classes. J.Comput. Syst. Sci, 1991, 43:425-440.
  • 2Goemans M X, Williamson D P. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems using Semidefinite Programming. Journal of the ACM, 1995, 42:1115-1145.
  • 3Feige U, Goemans M X. Approximating the Value of Two Prover Proof Systems, with Applications to MAX 2SAT and MAX DICUT. In: Proceedings of the 3nd Israel Symposium on Theory and Computing Systems. Tel Aviv, Israel, 1995, 182-189.
  • 4Ageev A, Hassin R, Sviridenko M. A 0.5-approximation Algorithm for the Max Dicut with Given Sizes of Parts. SIAM J. Discrete Math, 2001, 14:246-255.
  • 5Halperin E, Zwick U. A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. Random Structures and Algorithms, 2002, 20:382-402.
  • 6Xu D, Han J, Huang Z, Zhang L. Improved Approximation Algorithms for Max n/2-directed-bisectionand Max n/2-dense-subgraph. Journal of Global Optimization, 2003, 27:399-410.
  • 7Han Q, Ye Y, Zhang J. An Improved Rounding Method and Semidefinite Programming Relaxation for Graph Partition. Mathematical Programming, 2002, 92:509-535.
  • 8Ye Y, Zhang J. Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection. Journal of Global Optimization, 2003, 25:55-73.
  • 9Ye Y. A 0.699-approximation Algorithm for Max-Bisection. Mathematical Programming, 2001, 90:101-111.
  • 10Feige U, Langberg M. The RPR2 Rounding Technique for Semidefinite Programs. Proceedings of the 28th Int. Coll. on Automata, Languages and Programming, Crete, Greece, 2001, 213-2204.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部