Results 71 to 80 of about 1,392 (94)
k-core decomposition: a tool for the visualization of large scale networks
, 2005 We use the k-core decomposition to visualize large scale complex networks in two dimensions. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by progressively ...
Alvarez-Hamelin, José Ignacio +3 more
core +1 more source
MEDUSA - New Model of Internet Topology Using k-shell Decomposition
, 2006 The k-shell decomposition of a random graph provides a different and more insightful separation of the roles of the different nodes in such a graph than does the usual analysis in terms of node degrees.
Barabasi +12 more
core +2 more sources
Human behavior in image-based Road Health Inspection Systems despite the emerging AutoML. [PDF]
J Big Data, 2022 Siriborvornratanakul T.
europepmc +1 more source
, 2004 Traditional Insertion Sort runs in O(n^2) time because each insertion takes O(n) time. When people run Insertion Sort in the physical world, they leave gaps between items to accelerate insertions. Gaps help in computers as well.
Bender, Michael A. +2 more
core +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Colorectal cancer statistics, 2020
Ca-A Cancer Journal for Clinicians, 2020Rebecca L Siegel +2 more
exaly