| dc.creator | Tsiotas D., Charakopoulos A. | en |
| dc.date.accessioned | 2023-01-31T10:15:28Z | |
| dc.date.available | 2023-01-31T10:15:28Z | |
| dc.date.issued | 2020 | |
| dc.identifier | 10.1016/j.softx.2019.100379 | |
| dc.identifier.issn | 23527110 | |
| dc.identifier.uri | http://hdl.handle.net/11615/80014 | |
| dc.description.abstract | In this study, we provide the VisExpA (Visibility Expansion Algorithm), a computational code that implements a recently published method, which allows generating a visibility graph from a complex network instead of a time-series that is currently applicable. The proposed algorithm is applied to a complex network and it uses a node-wise control-attribute (network-nodes topological measure) to define the node-heights to which the original (time-series) visibility algorithm is applied. The VisExpA applies the idea of visibility graph from the field of time-series to complex networks and it allows interpreting the network topology as a landscape, making it a valuable tool of analysis in many disciplines. © 2019 The Authors | en |
| dc.language.iso | en | en |
| dc.source | SoftwareX | en |
| dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076688021&doi=10.1016%2fj.softx.2019.100379&partnerID=40&md5=fa80f2fda7d3a0ed524dd0e63d7ab46f | |
| dc.subject | Graph theory | en |
| dc.subject | Time series | en |
| dc.subject | Time series analysis | en |
| dc.subject | Visibility | en |
| dc.subject | Computational codes | en |
| dc.subject | Network node | en |
| dc.subject | Network topology | en |
| dc.subject | Visibility graphs | en |
| dc.subject | Complex networks | en |
| dc.subject | Elsevier B.V. | en |
| dc.title | VisExpA: Visibility expansion algorithm in the topology of complex networks | en |
| dc.type | journalArticle | en |