On editing graphs into 2-club clusters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7285 LNCS, Issue , 2012, Pages 235-246

  Liu, Hong ^a,b   Zhang, Peng ^a,b   Zhu, Daming ^a,b  

^a SHANDONG UNIVERSITY   (China)

^b Provincial Key Laboratory of Software Engineering   (China)

Author keywords

2 Club; Fixed Parameter Tractability; Graph based Data Clustering

Indexed keywords

2-CLUB; CONNECTED COMPONENT; DATA CLUSTERING; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; GRAPH MODIFICATIONS; NP COMPLETE; RUNNING TIME; THREE PROBLEMS; UNDIRECTED GRAPH;

CLUSTERING ALGORITHMS; PARAMETER ESTIMATION;

GRAPH THEORY;

EID: 84861220461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29700-7_22     Document Type: Conference Paper

References (15)

1. Alba, R.D.: A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology 3, 113-126 (1973)
2. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89-113 (2004)
3. Balasundaram, B., Butenko, S., Trukhanov, S.: Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization 10(1), 23-39 (2005)
4. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: Onproblems without polynomial kernels. Journal of Computer and System Sciences 75(8), 423-434 (2009)
5. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer (1999)
6. Garey, M., Johnson, D.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company (1979)
7. Guo, J., Kanj, I.A., Komusiewicz, C., Uhlmann, J.: Editing graphs into disjoint unions of dense clusters. Algorithmica 61, 949-970 (2011)
8. Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM Journal on Discrete Mathematics 24(4), 1662-1683 (2010)
9. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory of Computing Systems 47(1), 196-217 (2010)
10. Lee, V.E., Ruan, N., Jin, R., Aggarwal, C.: A survey of algorithms for dense subgraph discovery. In: Aggarwal, C.C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 303-336 (2010)
11. Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. Journal of Computer Systems and Science 20(2), 219-230 (1980)
12. Mahdavi, F., Balasundaram, B.: On inclusionwise maximal and max-imum cardinality k-clubs in graphs (2010), http://iem.okstate.edu/baski/files/DISCO- k-clubs-2010-02-11.pdf
13. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press (2006)
14. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2), 173-182 (2004)
15. Xu, R., Wunsch II, D.: Survey of clustering algorithms. IEEE Transactions on Neural Networks 16(3), 645-678 (2005)