Results 1 to 10 of about 157,967 (267)
A single-source shortest path algorithm for dynamic graphs
Graphs are mathematical structures used in many applications. In recent years, many applications emerged that require the processing of large dynamic graphs where the graph’s structure and properties change constantly over time.
Muteb Alshammari, Abdelmounaam Rezgui
doaj +2 more sources
Local Community Detection in Dynamic Graphs Using Personalized Centrality
Analyzing massive graphs poses challenges due to the vast amount of data available. Extracting smaller relevant subgraphs allows for further visualization and analysis that would otherwise be too computationally intensive.
Eisha Nathan +3 more
doaj +3 more sources
Cops and Robbers on Dynamic Graphs: Offline and Online Case [PDF]
We examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a graph instance is generated as a subgraph of the underlying graph of the model.
Stefan Balev +4 more
doaj +1 more source
Latent variable models (LVMs) for neural population spikes have revealed informative low-dimensional dynamics about the neural data and have become powerful tools for analyzing and interpreting neural activity.
Yicong Huang, Zhuliang Yu
doaj +1 more source
With the digital turn, data from connected devices are a new resource for understanding urban rhythms and mobility. Using the geolocated messages (1, 540, 000 tweets) of Twitter social network users recorded in 2015, this article uses dynamic graphs to ...
Françoise Lucchini +5 more
doaj +1 more source
The Evaluation of DyHATR Performance for Dynamic Heterogeneous Graphs
Dynamic heterogeneous graphs can represent real-world networks. Predicting links in these graphs is more complicated than in static graphs. Until now, research interest of link prediction has focused on static heterogeneous graphs or dynamically ...
Nasy`an Taufiq Al Ghifari +3 more
doaj +1 more source
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
We define a general model of stochastically-evolving graphs, namely the edge-uniform stochastically-evolving graphs. In this model, each possible edge of an underlying general static graph evolves independently being either alive or dead at each discrete
Ioannis Lamprou +2 more
doaj +1 more source
Static Call Graph Combination to Simulate Dynamic Call Graph Behavior
Call graphs are fundamental for many higher-level code analyses. The selection of the most appropriate call graph construction tool for an analysis is not always straightforward and depends on the purpose of the results’ further usage.
Zoltan Sagodi +4 more
doaj +1 more source
Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs
Efficiently embedding graphs in a Euclidean space has many benefits: It allows us to interpret and solve graph-theoretic problems using geometric and analytical methods.
Omkar Thakoor, T. K. Satish Kumar
doaj +1 more source
Correct cell/cell interactions and motion dynamics are fundamental in tissue homeostasis, and defects in these cellular processes cause diseases. Therefore, there is strong interest in identifying factors, including drug candidates that affect cell/cell ...
Felix Y Zhou +5 more
doaj +1 more source

