• Nenhum resultado encontrado

[PENDING] On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation

N/A
N/A
Info
Descarregar agora
Protected

Academic year: 2024

Share "On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation"

Copied!
40
0
0

Carregando.... (Ver texto completo agora)

Descarregar agora ( 40 páginas )

Texto

Imagem

Figure 1: A weighted directed multigraph D (left), and two edge temporalisations of D (middle and right), which differ only for the appearing times of the two edges from y to w (the edge labels denote the appearing time and the travel time, respectively, o
Figure 2: An example of a weighted directed multigraph D (left) and a collection of trips on D (right), where each starting node of a trip has a colored border
Figure 3: The temporal graph induced by the following temporalisation of the trips depicted in the right part of Figure 2: the starting time of T 1 is 1, of T 2 is 6, and of T 3 is 10.
Table 1: Our results assuming P 6 = NP (n denotes the number of nodes, m = P
+7

Referências

Descarregar agora ( PDF - 40 páginas - 579.89 KB )

Documentos relacionados