Abstract
Many applications, like the retrieval of information from the WWW, require or are improved by the detection of sets of closely related vertices in graphs. Depending on the application, many approaches are possible. In this paper we present a purely graph-theoretical approach, independent of the represented data. Based on the edge-connectivity of subgraphs, a tree of subgraphs is constructed, such that the children of a node are pairwise disjoint and contained in their parent. We describe a polynomial algorithm for the construction of the tree and present two efficient methods for the handling of dangling links vertices of low degree, constructing the correct result in significantly decreased time. Furthermore we give a short description of possible applications in the fields of information retrieval, clustering and graph drawing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Albert, R., Barabàsi, A.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Albert, R., Barabàsi, A., Jeong, H.: Scale-free characteristics of random network: The topology of the world wide web. Physica A 281, 69–77 (2000)
Albert, R., Jeong, H., Barabási, A.: Diameter of the world-wide web. Nature 401, 130–131 (1999)
Bharat, K., Henzinger, M.R.: Improved algorithms for topic distillation in a hyperlinked environment. In: Proceedings of SIGIR 1998, 21st ACM International Conference on Research and Development in Information Retrieval, Melbourne, AU, pp. 104–111 (1998)
Botafogo, R.A.: Cluster analysis for hypertext systems. In: Proc. of the 16-th Annual ACM SIGIR Conference of Res. and Dev. in Info. Retrieval, pp. 116–125 (1993)
Borodin, A., Roberts, G.O., Rosenthal, J.S., Tsaparas, P.: Finding authorities and hubs from link structures on the world wide web. World Wide Web, 415–429 (2001)
Botafogo, R.A., Shneiderman, B.: Identifying aggregates in hypertext structures. In: UK Conference on Hypertext, pp. 63–74 (1991)
Brinkmeier, M.: Communities in Graphs. Technical Report. Downloadable at, http://citeseer.nj.nec.com/brinkmeier02communities.html
Chakrabarti, S., Dom, B.E., Ravi Kumar, S., Raghavan, P., Rajagopalan, S., Tomkins, A., Gibson, D., Kleinberg, J.: Mining the Web’s link structure. Computer 32(8), 60–67 (1999)
Feng, Q., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol. 959, pp. 21–31. Springer, Heidelberg (1995)
Feng, Q.: Algorithms for Drawing Clustered Graphs. PhD thesis, Department of Computer Science and Software Engineering, University of Newcastle (1997)
Flake, G., Lawrence, S., Lee Giles, C.: Efficient identification of web communities. In: Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, August 20-23, pp. 150–160 (2000)
Gibson, D., Kleinberg, J.M., Raghavan, P.: Inferring web communities from link topology. In: UK Conference on Hypertext, pp. 225–234 (1998)
Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Information Processing Letters 76(4-6), 175–181 (2000)
Hartuv, E., Schmitt, A., Lange, J., Meier-Ewert, S., Lehrachs, H., Shamir, R.: An algorithm for clustering cDNAs for gene expression analysis. In: RECOMB, pp. 188–197 (1999)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (1998)
Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. Computer Networks (Amsterdam, Netherlands: 1999) 31(11-16), 1481–1493 (1999)
Litow, B.: A review of world wide web searching techniques, focusing on hits and related algorithms that utilise the link topology of the world wide web to provide the basis for a structure based search technology
Matula, D.W.: The cohesive strength of graphs. In: Chartrand, G., Kapoor, S.F. (eds.) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol. 110, pp. 215–221. Springer, Heidelberg (1969)
Matula, D.W.: k-components, clusters, and slicings in graphs. SIAM J. Appl. Math. 22(3), 459–480 (1972)
Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math. 5(1), 54–66 (1992)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brinkmeier, M. (2003). Communities in Graphs. In: Böhme, T., Heyer, G., Unger, H. (eds) Innovative Internet Community Systems. IICS 2003. Lecture Notes in Computer Science, vol 2877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39884-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-39884-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20436-7
Online ISBN: 978-3-540-39884-4
eBook Packages: Springer Book Archive