Now showing items 1-2 of 2

    • Efficient community identification and maintenance at multiple resolutions on distributed datastores 

      Aksu, H.; Canim, M.; Chang, Yuan-Chi; Korpeoglu, I.; Ulusoy, Ö. (Elsevier BV, 2015)
      The topic of network community identification at multiple resolutions is of great interest in practice to learn high cohesive subnetworks about different subjects in a network. For instance, one might examine the ...
    • Incremental k-core decomposition: algorithms and evaluation 

      Sarıyüce, A. E.; Gedik, B.; Jacques-Silva, G.; Wu, Kun-Lung; Catalyurek, U.V. (Association for Computing Machinery, 2016)
      A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ...