-
1
-
-
0001657065
-
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
-
2
-
-
4544250512
-
Expander flows, geometric embeddings and graph partitioning
-
New York: ACM Press
-
Arora, S., Rao, S., and Vazirani, U.: Expander Flows, Geometric Embeddings and Graph Partitioning. Proceedings of the STOC'04 Thirty-Sixth Annual ACM Symposium on Theory of Computing, New York: ACM Press (2004) 222-231
-
(2004)
Proceedings of the STOC'04 Thirty-sixth Annual ACM Symposium on Theory of Computing
, pp. 222-231
-
-
Arora, S.1
Rao, S.2
Vazirani, U.3
-
3
-
-
3142665421
-
Correlation clustering
-
Bansal, N. Blum, A., and Chawla, S.: Correlation Clustering. Machine Learning 56 1-3 (2004) 89-113
-
(2004)
Machine Learning
, vol.56
, Issue.1-3
, pp. 89-113
-
-
Bansal, N.1
Blum, A.2
Chawla, S.3
-
4
-
-
0142214892
-
Experiments on graph clustering algorithms
-
LNCS, Berlin: Springer-Verlag
-
Brandes, U., Gaertler, M., and Wagner, D.: Experiments on Graph Clustering Algorithms. Proceedings of the ESA 2003 Eleventh European Symposium on Algorithms, LNCS, Berlin: Springer-Verlag 2832 (2003) 568-579
-
(2003)
Proceedings of the ESA 2003 Eleventh European Symposium on Algorithms
, vol.2832
, pp. 568-579
-
-
Brandes, U.1
Gaertler, M.2
Wagner, D.3
-
5
-
-
0033721503
-
Graph structure in the web
-
Broder, A., Kumar, S.R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., and Wiener, J.: Graph Structure in the Web. Computer Networks 33 1-6 (2000) 309-320
-
(2000)
Computer Networks
, vol.33
, Issue.1-6
, pp. 309-320
-
-
Broder, A.1
Kumar, S.R.2
Maghoul, F.3
Raghavan, P.4
Rajagopalan, S.5
Stata, R.6
Tomkins, A.7
Wiener, J.8
-
6
-
-
51249170866
-
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
-
7
-
-
35048818727
-
Clustering of bipartite advertiser-keyword graph
-
Workshop on Clustering Large Data Sets, Melbourne, Florida
-
Carrasco, J.J., Fain, D.C., Lang, K.J., and Zhukov, L.: Clustering of Bipartite Advertiser-Keyword Graph. The ICDM 2003 Third IEEE International Conference on Data Mining, Workshop on Clustering Large Data Sets, Melbourne, Florida (2003)
-
(2003)
The ICDM 2003 Third IEEE International Conference on Data Mining
-
-
Carrasco, J.J.1
Fain, D.C.2
Lang, K.J.3
Zhukov, L.4
-
8
-
-
33745653830
-
A divide-and-merge methodology for clustering
-
Baltimore, June
-
Cheng, D., Kannan, R., Vempala, S., and Wang, G.: A Divide-and-Merge Methodology for Clustering. Proceedings of the PODS 2005 Twenty-Fourth ACM Symposium on Principles of Database Systems, Baltimore, June 2005
-
(2005)
Proceedings of the PODS 2005 Twenty-fourth ACM Symposium on Principles of Database Systems
-
-
Cheng, D.1
Kannan, R.2
Vempala, S.3
Wang, G.4
-
9
-
-
0742330612
-
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
-
11
-
-
33646179859
-
Conductance and congestion in power law graphs
-
New York: ACM Press
-
Gkantsidis, C., Mihail, M., and Saberi, A.: Conductance and Congestion in Power Law Graphs. Proceedings of the SIGMETRICS 2003 ACM International Conference on Measurement and Modeling of Computer Systems, New York: ACM Press (2003) 148-159
-
(2003)
Proceedings of the SIGMETRICS 2003 ACM International Conference on Measurement and Modeling of Computer Systems
, pp. 148-159
-
-
Gkantsidis, C.1
Mihail, M.2
Saberi, A.3
-
12
-
-
35248816402
-
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
-
13
-
-
84893405732
-
Data clustering: A review
-
Jain, A.K., Murty, M.N., and Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31 3 (1999) 264-323
-
(1999)
ACM Computing Surveys
, vol.31
, Issue.3
, pp. 264-323
-
-
Jain, A.K.1
Murty, M.N.2
Flynn, P.J.3
-
14
-
-
33745660287
-
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
-
15
-
-
0034497389
-
On clusterings: Good, bad and spectral
-
New York: IEEE Computer Society Press
-
Kannan, R., Vempala, S., and Vetta, A.: On Clusterings: Good, Bad and Spectral. Proceedings of the FOCS'00 Forty-First Annual Symposium on the Foundation of Computer Science, New York: IEEE Computer Society Press (2000) 367-377
-
(2000)
Proceedings of the FOCS'00 Forty-first Annual Symposium on the Foundation of Computer Science
, pp. 367-377
-
-
Kannan, R.1
Vempala, S.2
Vetta, A.3
-
16
-
-
0003037529
-
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
-
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
-
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
-
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
-
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
-
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
-
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
|