2018
DOI: 10.1007/978-3-319-99954-8_24
|View full text |Cite
|
Sign up to set email alerts
|

Betweenness Propagation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…The NavSys code version used in this paper has been developed by the Czech supercomputing center IT4I to provide an experimental testbed for extending the existing Sygic navigation by server-side routing with a traffic flow calculation for global optimization of city transportation. The NavSys application is a result of recent research on its main components, such as path reordering [40], kalternative paths [41,42], betweenness centrality [43,44,45], and probabilistic time-dependent routing [39]. Although the complete NavSys application is not publicly available, two of the important components codes, PTDR [39] and BC [43,44], have been disclosed and are available online 5 .…”
Section: Case Studymentioning
confidence: 99%
See 1 more Smart Citation
“…The NavSys code version used in this paper has been developed by the Czech supercomputing center IT4I to provide an experimental testbed for extending the existing Sygic navigation by server-side routing with a traffic flow calculation for global optimization of city transportation. The NavSys application is a result of recent research on its main components, such as path reordering [40], kalternative paths [41,42], betweenness centrality [43,44,45], and probabilistic time-dependent routing [39]. Although the complete NavSys application is not publicly available, two of the important components codes, PTDR [39] and BC [43,44], have been disclosed and are available online 5 .…”
Section: Case Studymentioning
confidence: 99%
“…Let us consider an application that periodically computes the Betweenness Centrality (BC) [43] over instances of graphs representing routing maps of cities and traffic information. This computation is expensive and for a large city 1: for every graph update do can also be periodic 2:…”
Section: Bc Explorationmentioning
confidence: 99%
“…The critical component for our traffic flow calculation is the Betweenness Centrality algorithm, which also poses the biggest challenge for computation efficiency. The Betweenness Centrality algorithm can alternatively be used as a tool for a what-if analysis on a real traffic network [31].…”
Section: Memoization and Precision Tuning Through The Antarex Dslmentioning
confidence: 99%
“…In the context of UC2, the server-side routing service is developed by IT4Innovations in collaboration with Sygic who provides its navigation smartphone app as a client-side endpoint for the routing service. Part of the server-side routing service is also a web-based interface for computing a betweenness centrality of a road network which can be used to model behavior of the traffic under certain conditions [37]. The web-based interface allows defining a number of what-if scenarios, including road closure, event which affects speed on roads in a given area and other options.…”
Section: B Navigationmentioning
confidence: 99%