2 papers
cs.DS2021
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Maciej Rymar, Hendrik Molter, André Nichterlein +1
In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality…
cs.DS2019
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
Vincent Froese, Brijnesh Jain, Maciej Rymar +1
Dynamic Time Warping (DTW) is a well-known similarity measure for time series. The standard dynamic programming approach to compute the DTW distance of two length- time series,…