Communities in graphs and hypergraphs

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2007, Pages 869-872

  Brinkmeier, Michael ^a   Recknagel, Sven ^a   Werner, Jeremias ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Cohesive Group, Edge Connectivity; Community; Components; Document Collection; Graph; Hypergraph; Image Segmentation

Indexed keywords

COHESIVE GROUP, EDGE-CONNECTIVITY; COMMUNITY; COMPONENTS; DOCUMENT COLLECTION; GRAPH; HYPERGRAPH;

DIGITAL IMAGE STORAGE; GRAPH THEORY; IMAGE SEGMENTATION; INFORMATION SERVICES; KNOWLEDGE MANAGEMENT;

EDGE DETECTION;

EID: 63449089122     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321563     Document Type: Conference Paper

References (17)

1. R. A. Botafogo. Cluster analysis for hypertext systems. In Proc. of the 16-th Annual ACM SIGIR Conference of Res. and Dev. in Info. Retrieval, pages 116-125, 1993.
2. R. A. Botafogo and B. Shneiderman. Identifying aggregates in hypertext structures. In UK Conference on Hypertext, pages 63-74, 1991.
3. M. Brinkmeier. Communities in graphs. In T. Bohme, G. Heyer, and H. Unger, editors, IICS, volume 2877 of Lecture Notes in Computer Science, pages 20-35. Springer, 2003.
4. M. Brinkmeier. A simple and fast min-cut algorithm. In M. Liskiewicz and R. Reischuk, editors, FCT, volume 3623 of Lecture Notes in Computer Science, pages 317-328. Springer, 2005.
5. M. Brinkmeier. Minimizing symmetric set functions faster, 2006. Technical Report, Technical University Ilmenau, Germany, 2006.
6. G. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 150-160, Boston, MA, August 20-23 2000.
7. G. W. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Self-organization of the web and identification of communities. IEEE Computer, 35(3):66-71, 2002.
8. M. Gaertler. Clustering. In U. Brandes and T. Erlebach, editors, Network Analysis, volume 3418 of Lecture Notes in Computer Science, pages 178-215. Springer, 2004.
9. R. E. T. Gary William Flake and K. Tsioutsiouliklis. Graph clustering and minimum cut trees. Internet Mathematics, 1(3):355-378, 2004.
10. R. Klimmek and F. Wagner. A simple hypergraph min cut algorithm, 1995.
11. F. Luccio and M. Sami. On the decomposition of networks in minimally interconnected subnetworks. IEEE Transactions on Circuit Theory, 16(2):184-188, 1969.
12. D. W. Matula. k-components, clusters, and slicings in graphs. SIAM J. Appl. Math., 22(3):459-480, 1972.
13. S. B. Seidman. Internal cohesion of ls sets in graphs. Social Networks, 5:97-107, 1983.
14. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
15. M. Stoer and F. Wagner. A simple min-cut algorithm. Journal ofthe ACM, 44(4):585-591, July 1997.
16. S. Wassermann and K. Faust. Social Networks Analysis: Methods and Applications. Cambridge University Press, 1994.
17. J. Werner. Kohesive gruppen in hypergraphen. Diplomarbeit, Technische Universität Ilmenau, Germany, 2007.