skip to main content
department
Free Access

Degrees of separation

Published:01 July 2012Publication History
Skip Abstract Section

Abstract

Rsearchers now have the capability to look at the small-world problem from both the traditional algorithmic approach and the new topological approach.

References

  1. Backstrom, L., Boldi, P., Rosa, M., Ugander, J., and Vigna, S. Four degrees of separation, http://arxiv.org/abs/1111.4570, Jan. 6, 2012.Google ScholarGoogle Scholar
  2. Bakhshandeh, R., Samadi, M., Azimifar, Z., and Schaeffer, J. Degrees of separation in social networks, Proceedings of the Fourth International Symposium on Combinatorial Search, Barcelona, Spain, July 15-16, 2011.Google ScholarGoogle Scholar
  3. Goel, S., Muhamad, R., and Watts, D. Social search in "small-world" experiments, 18th International World Wide Web Conference, Madrid, Spain, April 20-24, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Kleinberg, J. The small-world phenomenon: an algorithmic perspective, 32nd ACM Symposium on Theory of Computing, Portland, OR, May 21-23, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. West, R., and Leskovec, J. Human wayfinding in information networks, 22nd International World Wide Web Conference, Lyon, France, April 16-20, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Degrees of separation

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image Communications of the ACM
            Communications of the ACM  Volume 55, Issue 7
            July 2012
            120 pages
            ISSN:0001-0782
            EISSN:1557-7317
            DOI:10.1145/2209249
            Issue’s Table of Contents

            Copyright © 2012 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 July 2012

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • department
            • Popular
            • Un-reviewed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          HTML Format

          View this article in HTML Format .

          View HTML Format