Journal
CHAOS
Volume 25, Issue 8, Pages -Publisher
AIP Publishing
DOI: 10.1063/1.4927835
Keywords
-
Categories
Funding
- National High Technology Research and Development Program of China (863 Program) [2013AA013801]
- National Natural Science Foundation of China [61174022]
- Specialized Research Fund for the Doctoral Program of Higher Education [20131102130002]
- RAMP
- D Program of China [2012BAH07B01]
- State Key Laboratory of Virtual Reality Technology, Systems, Beihang University [BUAA-VR-14KF-02]
- General Research Program of the Science
- Sichuan Provincial Department of Education [14ZB0322]
Ask authors/readers for more resources
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)). (C) 2015 AIP Publishing LLC.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
