Time-Dependent Graphs: Definitions, Applications, and Algorithms
Abstract A time-dependent graph is, informally speaking, a graph structure dynamically changes with time. In such graphs, the weights associated with edges dynamically change over time, that is, the edges in such graphs are activated by sequences of time-dependent elements. Many real-life scenarios...
Main Authors: | Yishu Wang, Ye Yuan, Yuliang Ma, Guoren Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-09-01
|
Series: | Data Science and Engineering |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41019-019-00105-0 |
Similar Items
-
A Schema-Driven Synthetic Knowledge Graph Generation Approach With Extended Graph Differential Dependencies (GDD<sup>x</sup>s)
by: Zaiwen Feng, et al.
Published: (2021-01-01) -
Misjudgment of
interrupted time-series graphs due to serial dependence: Replication of Matyas
and Greenwood (1990)
by: Anthony J. Bishara, et al.
Published: (2021-05-01) -
Special Issue on “Graph Algorithms and Applications”
by: Serafino Cicerone, et al.
Published: (2021-05-01) -
A Graph Convolutional Network With Multiple Dependency Representations for Relation Extraction
by: Yanfeng Hu, et al.
Published: (2021-01-01) -
GraphKKE: graph Kernel Koopman embedding for human microbiome analysis
by: Kateryna Melnyk, et al.
Published: (2020-12-01)