Results 11 to 20 of about 157,967 (267)
Fast and adaptive dynamics-on-graphs to dynamics-of-graphs translation
Frontiers in Big Data, 2023 Numerous networks in the real world change with time, producing dynamic graphs such as human mobility networks and brain networks. Typically, the “dynamics on graphs” (e.g., changing node attribute values) are visible, and they may be connected to and suggestive of the “dynamics of graphs” (e.g., evolution of the graph topology). Due to two fundamental
Lei Zhang 0158 +3 more
openaire +3 more sources
On the Treewidth of Dynamic Graphs [PDF]
Theoretical Computer Science, 2013 Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to identify the graph properties that can be preserved over time and understand their respective computability.
Bernard Mans, Luke Mathieson
openaire +3 more sources
Algorithmica, 2017 In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used.
Luis Barba +6 more
openaire +6 more sources
On Dynamic Succinct Graph Representations [PDF]
2020 Data Compression Conference (DCC), 2020 This research has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Actions H2020-MSCA-RISE-2015 BIRDS GA No ...
Miguel E. Coimbra +5 more
openaire +3 more sources
2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020 We present a fast dynamic graph data structure for the GPU. Our dynamic graph structure uses one hash table per vertex to store adjacency lists and achieves 3.4–14.8x faster insertion rates over the state of the art across a diverse set of large datasets, as well as deletion speedups up to 7.8x.
Muhammad A. Awad +3 more
openaire +2 more sources
Information and Computation, 2012 25 pages, 9 figures, LaTeX, v2: Minor presentation improvements, v3: Typos corrected, figure ...
Arrighi, Pablo, Dowek, Gilles
openaire +5 more sources
Dynamic graph convolutional networks [PDF]
Pattern Recognition, 2020 Many different classification tasks need to manage structured data, which are usually modeled as graphs. Moreover, these graphs can be dynamic, meaning that the vertices/edges of each graph may change during time. Our goal is to jointly exploit structured data and temporal information through the use of a neural network model.
Franco Manessi +2 more
openaire +2 more sources
Classical dynamics on graphs [PDF]
Physical Review E, 2001 42 pages and 8 ...
Barra, F., Gaspard, P.
openaire +3 more sources
Dynamic Planar Embeddings of Dynamic Graphs [PDF]
Theory of Computing Systems, 2017 Announced at STACS ...
Jacob Holm, Eva Rotenberg
openaire +7 more sources
Dynamic Structural Clustering on Graphs [PDF]
Proceedings of the 2021 International Conference on Management of Data, 2021 Structural Clustering ($DynClu$) is one of the most popular graph clustering paradigms. In this paper, we consider $StrClu$ under two commonly adapted similarities, namely Jaccard similarity and cosine similarity on a dynamic graph, $G = \langle V, E\rangle$, subject to edge insertions and deletions (updates).
Boyu Ruan +3 more
openaire +4 more sources