| Literature DB >> 26328556 |
Xin Lan1, Hongming Mo1, Shiyu Chen1, Qi Liu2, Yong Deng1.
Abstract
The visibility graph method is used to transform time series into complex networks. In this letter, a fast transform algorithm is proposed for obtaining a visibility graph. Based on the strategy of "divide & conquer," the time complexity of the proposed algorithm is raised to O(n log n), which is more efficient than the previous basic algorithm whose time complexity is O(n(2)).Mesh:
Year: 2015 PMID: 26328556 DOI: 10.1063/1.4927835
Source DB: PubMed Journal: Chaos ISSN: 1054-1500 Impact factor: 3.642