<?xml version='1.0' encoding='UTF-8'?><codeBook xmlns="ddi:codebook:2_5" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="ddi:codebook:2_5 https://ddialliance.org/Specification/DDI-Codebook/2.5/XMLSchema/codebook.xsd" version="2.5"><docDscr><citation><titlStmt><titl>Runtime Data of Horizontal Visibility Algorithms for synthetic and empirical Time Series</titl><IDNo agency="DOI">doi:10.26249/FK2/MXFPLV</IDNo></titlStmt><distStmt><distrbtr source="archive">osnaData</distrbtr><distDate>2022-12-19</distDate></distStmt><verStmt source="archive"><version date="2023-01-27" type="RELEASED">2</version></verStmt><biblCit>Schmidt, Jonas, 2022, "Runtime Data of Horizontal Visibility Algorithms for synthetic and empirical Time Series", https://doi.org/10.26249/FK2/MXFPLV, osnaData, V2</biblCit></citation></docDscr><stdyDscr><citation><titlStmt><titl>Runtime Data of Horizontal Visibility Algorithms for synthetic and empirical Time Series</titl><IDNo agency="DOI">doi:10.26249/FK2/MXFPLV</IDNo></titlStmt><rspStmt><AuthEnty affiliation="Osnabrück University">Schmidt, Jonas</AuthEnty></rspStmt><prodStmt/><distStmt><distrbtr source="archive">osnaData</distrbtr><contact affiliation="Osnabrück University" email="jonschmidt@uni-osnabrueck.de">Schmidt, Jonas</contact><depositr>Schmidt, Jonas</depositr><depDate>2022-12-16</depDate></distStmt></citation><stdyInfo><subject><keyword>Computer and Information Science</keyword><keyword>Graph Theory</keyword><keyword>Computational Complexity Theory</keyword><keyword>Horizontal Visibility Graphs</keyword></subject><abstract date="2022-12-16">This repository contains the computed runtimes of state-of-the-art horizontal visibility algorithms for synthetic and empirical time series. The provided Python code was used to compute the runtime data and includes implementations of various horizontal visibility algorithms. The main contribution is a newly developed algorithm that extends the fast weighted horizontal visibility algorithm of Zhu et al. . The proposed algorithm works efficiently on streamed data, is multi-processing capable, and has linear runtime in the worst case.</abstract><sumDscr/></stdyInfo><method><dataColl><sources/></dataColl><anlyInfo/></method><dataAccs><notes type="DVN:TOU" level="dv">CC0 Waiver</notes><setAvail/><useStmt/></dataAccs><othrStdyMat/></stdyDscr><otherMat ID="f1176" URI="https://doi.org/10.26249/FK2/MXFPLV/VXXJ6O" level="datafile"><labl>hvg_runtimes_data_v2.zip</labl><txt>Version 2</txt><notes level="file" type="DATAVERSE:CONTENTTYPE" subject="Content/MIME Type">application/zip</notes></otherMat><otherMat ID="f1174" URI="https://doi.org/10.26249/FK2/MXFPLV/Z1ZSCM" level="datafile"><labl>hvg_runtimes_data.zip</labl><notes level="file" type="DATAVERSE:CONTENTTYPE" subject="Content/MIME Type">application/zip</notes></otherMat></codeBook>