This shows you the differences between two versions of the page.

notes:urls:net:time [2016/06/04 23:42] vlado [Temporal networks] |
notes:urls:net:time [2016/06/04 23:43] (current) vlado |
||
---|---|---|---|

Line 128: | Line 128: | ||

- | ===== Problems ===== | ||

- | October 28-30, 2013 | ||

- | |||

- | ==== Definitions ==== | ||

- | |||

- | **Overview of the definitions/approaches from literature:** | ||

- | |||

- | * Pajek's approach (intervals and events) - discrete time | ||

- | * Sonia's approach - continuos time | ||

- | * Holme's approach | ||

- | |||

- | **Types of temporal networks:** | ||

- | Can be important in solving the problems. | ||

- | |||

- | * Sonia | ||

- | * Pajek | ||

- | * Holme | ||

- | * single intervals with the same terminal time - publications, citations | ||

- | |||

- | ==== Standard network problems for temporal networks ==== | ||

- | |||

- | Which of the "standard" problems (reachability/connectivity, strong components, fastest/shortest paths, ...) can be extended to temporal networks and how? | ||

- | |||

- | It seems that some of these problems were already (at least partially) studied. | ||

- | |||

- | **Questions:** | ||

- | |||

- | * How is the movement realized? Instantaneously? The weight of a link equals to the transition time? | ||

- | * Can a vertex in which is the traveler be inactive between its arrival and its departure? | ||

- | * Can we construct semirings for the selected problems? |

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported