Search Results - subject:"Graph algorithm"

Solving the Maximum Clique Problem using a Hybrid Particle Swarm Optimization Algorithm

Tayachi, Dalila; Khemiri, Marwa - In: International Journal of Operations Research and … 9 (2018) 4, pp. 21-35

This article tackles the maximum clique problem MCP known as an NP-hard graph problem. The maximum clique problem consists in finding in an undirected graph a complete sub-graph (clique) of maximum cardinality. As the MCP is a classical graph problem extensively studied, the main contribution of...

Persistent link: https://www.econbiz.de/10012046957

Complexity traits and dynamics of tourism destinations

Sainaghi, Ruggero; Baggio, Rodolfo - In: Tourism management : research, policies, practice 63 (2017), pp. 368-382

Persistent link: https://www.econbiz.de/10011746696

Mapping time series into networks as a tool to assess the complex dynamics of tourism systems

Baggio, Rodolfo; Sainaghi, Ruggero - In: Tourism management : research, policies, practice 54 (2016), pp. 23-33

Persistent link: https://www.econbiz.de/10011451924

Fast algorithms for determining (generalized) core groups in social networks

Batagelj, Vladimir; Zaveršnik, Matjaž - In: Advances in Data Analysis and Classification 5 (2011) 2, pp. 129-145

Persistent link: https://www.econbiz.de/10009149781