Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Innovative Internet Community Systems

IICS 2003: Innovative Internet Community Systems pp 20–35Cite as

Communities in Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2877))

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Barabàsi, A.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  2. 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)

    Google Scholar 

  3. Albert, R., Jeong, H., Barabási, A.: Diameter of the world-wide web. Nature 401, 130–131 (1999)

    Article  Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Botafogo, R.A., Shneiderman, B.: Identifying aggregates in hypertext structures. In: UK Conference on Hypertext, pp. 63–74 (1991)

    Google Scholar 

  8. Brinkmeier, M.: Communities in Graphs. Technical Report. Downloadable at, http://citeseer.nj.nec.com/brinkmeier02communities.html

  9. 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)

    Article  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Feng, Q.: Algorithms for Drawing Clustered Graphs. PhD thesis, Department of Computer Science and Software Engineering, University of Newcastle (1997)

    Google Scholar 

  12. 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)

    Google Scholar 

  13. Gibson, D., Kleinberg, J.M., Raghavan, P.: Inferring web communities from link topology. In: UK Conference on Hypertext, pp. 225–234 (1998)

    Google Scholar 

  14. Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Information Processing Letters 76(4-6), 175–181 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. 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)

    Google Scholar 

  16. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (1998)

    Google Scholar 

  17. 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)

    Google Scholar 

  18. 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

    Google Scholar 

  19. 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)

    Chapter  Google Scholar 

  20. Matula, D.W.: k-components, clusters, and slicings in graphs. SIAM J. Appl. Math. 22(3), 459–480 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  21. Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math. 5(1), 54–66 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  22. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Automation, Institute for Theoretical and Technical Computer Science, Technical University Ilmenau,  

    Michael Brinkmeier

Authors
  1. Michael Brinkmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematik, Technische Universität Ilmenau, PF 100565, 98684, Ilmenau, Germany

    Thomas Böhme

  2. Institute of Computer Science, University of Leipzig,  

    Gerhard Heyer

  3. Computer Science Dept., University of Rostock, 18051, Rostock, Germany

    Herwig Unger

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation