Sitting Closer to Friends than Enemies, Revisited
暂无分享,去创建一个
[1] Stavros D. Nikolopoulos,et al. The Longest Path Problem Is Polynomial on Interval Graphs , 2009, MFCS.
[2] S Redner,et al. Dynamics of social balance on networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[3] F. Harary,et al. STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .
[4] Sahin Albayrak,et al. Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.
[5] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Michal Pilipczuk,et al. Sitting Closer to Friends Than Enemies, Revisited , 2012, MFCS.
[7] Stephan Olariu,et al. Simple Linear Time Recognition of Unit Interval Graphs , 1995, Inf. Process. Lett..
[8] Jure Leskovec,et al. Signed networks in social media , 2010, CHI.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] S. Olariu,et al. Optimal greedy algorithms for indifference graphs , 1992, Proceedings IEEE Southeastcon '92.
[11] Louis Ibarra,et al. A simple algorithm to find Hamiltonian cycles in proper interval graphs , 2009, Inf. Process. Lett..
[12] Jure Leskovec,et al. Predicting positive and negative links in online social networks , 2010, WWW '10.
[13] George B. Mertzios. A polynomial algorithm for the k-cluster problem on the interval graphs , 2006, Electron. Notes Discret. Math..
[14] James A. Davis. Clustering and Structural Balance in Graphs , 1977 .
[15] Anne-Marie Kermarrec,et al. Can Everybody Sit Closer to Their Friends Than Their Enemies? , 2011, MFCS.
[16] David Eppstein,et al. Self-overlapping curves revisited , 2008, SODA.
[17] Jure Leskovec,et al. Governance in Social Media: A Case Study of the Wikipedia Promotion Process , 2010, ICWSM.
[18] Michael Szell,et al. Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.
[19] Sylvain Guillemot,et al. Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[20] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[21] Klaudia Frankfurter. Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .
[22] Martin Vatshelle,et al. Graph classes with structured neighborhoods and algorithmic applications , 2011, Theor. Comput. Sci..