메뉴 건너뛰기




Volumn 3831 LNCS, Issue , 2006, Pages 530-537

On the NP-completeness of some graph cluster measures

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; GRAPHIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

EID: 33745659811     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11611257_51     Document Type: Conference Paper
Times cited : (70)

References (24)
  • 1
    • 0001657065 scopus 로고    scopus 로고
    • Some APX-completeness results for cubic graphs
    • Alimonti, P., Kann, V.: Some APX-Completeness Results for Cubic Graphs. Theoretical Computer Science 237 1-2 (2000) 123-134
    • (2000) Theoretical Computer Science , vol.237 , Issue.1-2 , pp. 123-134
    • Alimonti, P.1    Kann, V.2
  • 6
    • 51249170866 scopus 로고
    • Graph bisection algorithms with good average case behavior
    • Bui, T.N., Chaudhuri, S., Leighton, F.T., and Sipser, M.: Graph Bisection Algorithms with Good Average Case Behavior. Combinatorica 7 2 (1987) 171-191
    • (1987) Combinatorica , vol.7 , Issue.2 , pp. 171-191
    • Bui, T.N.1    Chaudhuri, S.2    Leighton, F.T.3    Sipser, M.4
  • 9
    • 0742330612 scopus 로고    scopus 로고
    • Graph clustering techniques based on minimum-cut trees
    • NEC, Princeton, NJ
    • Flake, G.W., Tsioutsiouliklis, K., and Tarjan, R.E.: Graph Clustering Techniques Based on Minimum-Cut Trees. Technical report 2002-06, NEC, Princeton, NJ (2002)
    • (2002) Technical Report , vol.2002 , Issue.6
    • Flake, G.W.1    Tsioutsiouliklis, K.2    Tarjan, R.E.3
  • 12
    • 35248816402 scopus 로고    scopus 로고
    • The complexity of detecting fixed-density clusters
    • Proceedings of the CIAC 2003 Fifth Italian Conference on Algorithms and Complexity, Berlin: Springer-Verlag
    • Holzapfel, K., Kosub, S., Maaß, M.G., and Täubig, H.: The Complexity of Detecting Fixed-Density Clusters. Proceedings of the CIAC 2003 Fifth Italian Conference on Algorithms and Complexity, LNCS 2653, Berlin: Springer-Verlag (2003) 201-212
    • (2003) LNCS , vol.2653 , pp. 201-212
    • Holzapfel, K.1    Kosub, S.2    Maaß, M.G.3    Täubig, H.4
  • 14
    • 33745660287 scopus 로고    scopus 로고
    • On the expansion of graphs of 0/1-polytopes
    • arXiv:math.CO/0112146
    • Kaibel, V.: On the Expansion of Graphs of 0/1-Polytopes. Technical report arXiv:math.CO/0112146 (2001)
    • (2001) Technical Report
    • Kaibel, V.1
  • 16
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R.E. Miller and J.W. Thatcher (eds) New York: Plenum Press
    • Karp, R.M.: Reducibility among Combinatorial Problems. In R.E. Miller and J.W. Thatcher (eds), Complexity of Computer Computations, New York: Plenum Press (1972) 85-103
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 17
    • 0000651166 scopus 로고    scopus 로고
    • Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
    • Leighton, T., and Rao, S.: Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms. Journal of the ACM 46 6 (1999) 787-832
    • (1999) Journal of the ACM , vol.46 , Issue.6 , pp. 787-832
    • Leighton, T.1    Rao, S.2
  • 18
    • 0006217743 scopus 로고    scopus 로고
    • Random walks on graphs: A survey
    • Bolyai Society Mathematical Studies, 2 Paul Erdos is Eighty, Budapest: Bolyai Mathematical Society
    • Lovász, L.: Random Walks on Graphs: A Survey. Bolyai Society Mathematical Studies, 2, Combinatorics, Paul Erdos is Eighty, Budapest: Bolyai Mathematical Society 2 (1996) 353-397
    • (1996) Combinatorics , vol.2 , pp. 353-397
    • Lovász, L.1
  • 19
    • 24244449859 scopus 로고    scopus 로고
    • On the semantics of internet topologies
    • College of Computing, Georgia Institute of Technology, Atlanta, GA
    • Mihail, M., Gkantsidis, C., Saberi, A., and Zegura, E.: On the Semantics of Internet Topologies. Technical Report GIT-CC-02-07, College of Computing, Georgia Institute of Technology, Atlanta, GA (2002)
    • (2002) Technical Report , vol.GIT-CC-02-07
    • Mihail, M.1    Gkantsidis, C.2    Saberi, A.3    Zegura, E.4
  • 20
    • 26944485494 scopus 로고    scopus 로고
    • Stochastic local clustering for massive graphs
    • Proceedings of the PAKDD 2005 Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining, Berlin, Springer-Verlag
    • Schaeffer, S.E.: Stochastic Local Clustering for Massive Graphs. Proceedings of the PAKDD 2005 Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining, LNCS 3518, Berlin, Springer-Verlag (2005) 354-360
    • (2005) LNCS , vol.3518 , pp. 354-360
    • Schaeffer, S.E.1
  • 21
    • 84901476329 scopus 로고    scopus 로고
    • Cluster graph modification problems
    • Proceedings of the WG 2002 Twenty-eighth International Workshop on Graph-Theoretic Concepts in Computer Science Berlin: Springer-Verlag
    • Shamir, R., Sharan, R., and Tsur, D.: Cluster Graph Modification Problems. Proceedings of the WG 2002 Twenty-eighth International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 2573, Berlin: Springer-Verlag (2002) 379-390
    • (2002) LNCS , vol.2573 , pp. 379-390
    • Shamir, R.1    Sharan, R.2    Tsur, D.3
  • 23
    • 33745658808 scopus 로고    scopus 로고
    • Properties of nonuniform random graph models
    • Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland
    • Virtanen, S.E.: Properties of Nonuniform Random Graph Models. Technical Report HUT-TCS-A77, Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland (2003)
    • (2003) Technical Report , vol.HUT-TCS-A77
    • Virtanen, S.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.