Skip to content

Advertisement

Articles

Page 2 of 2

  1. Content type: Research

    The critical node detection problem (CNDP) aims to fragment a graph G=(V,E) by removing a set of vertices R with cardinality |R|≤k, such that the residual graph has minimum pairwise connectivity for user-defined ...

    Authors: Mario Ventresca and Dionne Aleman

    Citation: Computational Social Networks 2015 2:6

    Published on:

  2. Content type: Research

    Dealing with big data in computational social networks may require powerful machines, big storage, and high bandwidth, which may seem beyond the capacity of small labs. We demonstrate that researchers with lim...

    Authors: Ming Jia, Hualiang Xu, Jingwen Wang, Yiqi Bai, Benyuan Liu and Jie Wang

    Citation: Computational Social Networks 2015 2:5

    Published on:

  3. Content type: Research

    Social networks are often degree correlated between nearest neighbors, an effect termed homophily, wherein individuals connect to nearest neighbors of similar connectivity. Whether friendships or other associa...

    Authors: Michael Mayo, Ahmed Abdelzaher and Preetam Ghosh

    Citation: Computational Social Networks 2015 2:4

    Published on:

  4. Content type: Research

    We study the dynamics of a game-theoretic network formation model that yields large-scale small-world networks. So far, mostly stochastic frameworks have been utilized to explain the emergence of these network...

    Authors: Omid Atabati and Babak Farzad

    Citation: Computational Social Networks 2015 2:1

    Published on:

  5. Content type: Research

    A lot of daily activities require more than one person to participate and collaborate with each other; however, for many people, it is not easy to find good partners to engage in activities with one another. W...

    Authors: Chunyu Ai, Wei Zhong, Mingyuan Yan and Feng Gu

    Citation: Computational Social Networks 2014 1:5

    Published on:

  6. Content type: Research

    The observed unbalance of spectrum utilization combined with the proliferation of wireless devices and the growth of online social networks call for a joint study of cognitive radios (CRs) and social networkin...

    Authors: Evangelos Anifantis, Eleni Stai, Vasileios Karyotis and Symeon Papavassiliou

    Citation: Computational Social Networks 2014 1:4

    Published on:

  7. Content type: Research

    This paper investigates the influence maximization (IM) problem in social networks under the linear threshold (LT) model. Kempe et al. (ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 137–146...

    Authors: Zaixin Lu, Lidan Fan, Weili Wu, Bhavani Thuraisingham and Kai Yang

    Citation: Computational Social Networks 2014 1:2

    Published on:

  8. Content type: Research

    Community partition is of great importance in sociology, biology and computer science. Due to the exponentially increasing amount of social network applications, a fast and accurate method is necessary for com...

    Authors: Zaixin Lu, Yuqing Zhu, Wei Li, Weili Wu and Xiuzhen Cheng

    Citation: Computational Social Networks 2014 1:1

    Published on:

Annual Journal Metrics

  • Speed
    121 days to first decision for reviewed manuscripts only
    115 days to first decision for all manuscripts
    262 days from submission to acceptance
    19 days from acceptance to publication

    Usage 
    31,574 downloads
    26 Altmetric mentions

APC Funding

Concerned about article-processing charges (APCs)? Find out more about institutional memberships, APC funding opportunites and waivers.

Advertisement