… whether k-core decomposition of large networks can be … algorithm for k-core decomposition
in Webgraph. With our implementations, we show that we can efficiently handle networks of …

… algorithm for core decomposition [20]. When main memory is not sufficient to keep the entire
network, our algorithm is able to perform core decomposition efficiently for networks with up …

… core decomposition concept. More specifically, we present the application of the core
decomposition concept in domains such as: network … , text mining, biological network analysis and …

… algorithm based on the k-core decomposition able to uncover in a two-dimensional
layout several topological and hierarchical properties of large scale networks. The k-core …

… of core decomposition of a multilayer network. Unlike the single-layer counterpart in which
cores … challenging as no total order exists among multilayer cores; rather, they form a lattice …

… introducing a notion of temporal core decomposition where each core is associated with
two … interval: we call such cores span-cores. For a temporal network defined on a discrete …

… In this paper, we propose a visualization algorithm based on the k-core decomposition able
… and hierarchical properties of large scale networks. The k-core decomposition [4] consists in …

… In this work, we focus on incremental maintenance of k-core decomposition of large networks
modeled as undirected and unweighted graphs. Here, we start by giving several definitions …

… To our knowledge, core decomposition of directed ML networks has not been studied before…
Since there are no prior algorithms for core decomposition of directed ML networks, we just …

… the creation of new core decomposition algorithms that can … , a new core decomposition
algorithm that combines multiple … core decomposition on networks and briefly cover network …