A characterization of horizontal visibility graphs and combinatorics on words

Physica A: Statistical Mechanics and its Applications

Volumn 390, Issue 12, 2011, Pages 2421-2428

  Gutin, Gregory ^a   Mansour, Toufik ^b   Severini, Simone ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF HAIFA   (Israel)

^c UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Networks; Time series

Indexed keywords

NETWORKS (CIRCUITS); SET THEORY; TIME SERIES; TIME SERIES ANALYSIS; VISIBILITY;

ALGEBRAIC COMBINATORICS; ANALYTIC COMBINATORICS; COMBINATORICS ON WORDS; DEGREE DISTRIBUTIONS; GOOD DISCRIMINATORS; HORIZONTAL VISIBILITY GRAPHS; NON-CROSSING GRAPHS; RECOGNITION ALGORITHM;

GRAPH THEORY;

EID: 79954592663     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2011.02.031     Document Type: Article

References (12)

1. B. Luque, L. Lacasa, F. Ballesteros, and J. Luque Horizontal visibility graphs: exact results for random time series Phys. Rev. E 80 2009 046103
2. J.M. Ho, A. Suzuki, and M. Sarrafzadeh An exact algorithm for single-layer wire length minimization IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 12 1 1993 175 180
3. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 1997 Springer-Verlag
4. L. Lacasa, B. Luque, F. Ballesteros, J. Luque, and J.C. Nuno From time series to complex networks: the visibility graph Proc. Natl. Acad. Sci. 105 13 2008 4972 4975 (Pubitemid 351738493)
5. L. Lacasa, B. Luque, J. Luque, and J.C. Nuno The visibility graph: a new method for estimating the Hurst exponent of fractional Brownian motion Europhys. Lett. 86 2009 30001
6. L. Lacasa, and R. Toral Description of stochastic and chaotic series using visibility graphs Phys. Rev. E 82 2010 036120
7. S.L. Mitchell Linear time algorithms to recognize outerplanar and maximal outerplanar graphs Inform. Process. Lett. 9 1979 229 232
8. M.C. van Lier, R.H.J.M. Otten, C.A.D. of masks and wiring, T. H. Rept. 74-E-44, Dept. Elect. Engrg., Eindhoven University of Technology, 1974.
9. A. Lingas Subgraph isomorphism for biconnected outerplanar graphs in cubic time Theoret. Comput. Sci. 63 1989 295 302
10. P. Flajolet, and M. Noy Analytic combinatorics of non-crossing configurations Discrete Math. 204 1999 203 229 (Pubitemid 129550446)
11. R. Tamassia, and I.G. Tollis A unified approach to visibility representations of planar graphs Discrete Comput. Geom. 1 1986 321 341
12. H. ElGindy, Hierarchical decomposition of polygon with applications, Ph.D. Thesis, McGill University, 1985.