Results 21 to 30 of about 232,761 (262)
Classical dynamics on graphs [PDF]
Physical Review E, 2001 42 pages and 8 ...
Barra, F., Gaspard, P.
openaire +3 more sources
Cooperative Control for Damping Inter-Area Oscillations Using Dynamic State Information
IEEE Access, 2019 With the ever-growing complexity of a modern power system, decentralized control is becoming a more advantageous framework for maintaining its stable operation. Recently, some research work has been done on decentralized control for mitigating inter-area
Yan Xu +6 more
doaj +1 more source
Dynamic Planar Embeddings of Dynamic Graphs [PDF]
Theory of Computing Systems, 2017 Announced at STACS ...
Jacob Holm, Eva Rotenberg
openaire +7 more sources
Journal of Open Research Software, 2022 The Dynamic Synchronization Toolbox allows the calculation of dynamic graphs based on phase synchronization in experimental data. This enables an analysis of the time-development of network connectivity between multiple recording sites (e.g.
Nils Rosjat, Silvia Daun
doaj +1 more source
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
Space-Efficient Fully Dynamic DFS in Undirected Graphs †
Algorithms, 2019 Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in O ( n + m ) time for a graph with n vertices and m edges.
Kengo Nakamura, Kunihiko Sadakane
doaj +1 more source
Enhancing the Local Graph Semantic Feature for 3D Point Cloud Classification and Segmentation
IEEE Access, 2022 Most graph convolutional neural networks process point clouds by constructing local graphs, then increasing the number of channels by $1\times 1$ convolution, and using max pooling aggregation features.
Yong Wang, Xintong Tang, Chenke Yue
doaj +1 more source
CoRR, 2015 Graph databases in many applications---semantic web, transport or biological networks among others---are not only large, but also frequently modified. Evaluating graph queries in this dynamic context is a challenging task, as those queries often combine first-order and navigational features.
Pablo Muñoz 0004 +2 more
openaire +4 more sources
Dynamic programming for graphs on surfaces [PDF]
ACM Transactions on Algorithms, 2010 We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs onnvertices and branchwidth at mostk. Our technique applies to general families of problems where standard dynamic programming runs in 2O(k⋅logk)⋅nsteps.
Juanjo Rué +2 more
openaire +9 more sources
Theoretical Computer Science, 2016 Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system $f:A^n\to A^n$ with $G$ as interaction graph has a "complex" dynamics ?
Maximilien Gadouleau, Adrien Richard
openaire +4 more sources