返回
Computational methods for finding long simple cycles in complex networks
DOI:10.1016/j.knosys.2017.03.022.png)
摘要
En 中文
Detection of long simple cycles in real-world complex networks finds many applications in layout algorithms, information flow modelling, as well as in bioinformatics. In this paper, we propose two computational methods for finding long cycles in real-world networks. The first method is an exact approach based on our own integer linear programming formulation of the problem and a data mining pipeline. This pipeline ensures that the problem is solved as a sequence of integer linear programs. The second method is a multi-start local search heuristic, which combines an initial construction of a long cycle using depth-first search with four different perturbation operators. Our experimental results are presented for social network samples, graphs studied in the network science field, graphs from DIMACS series, and protein-protein interaction networks. These results show that our formulation leads to a significantly more efficient exact approach to solve the problem than a previous formulation. For 14 out of 22 networks, we have found the optimal solutions. The potential of heuristics in this problem is also demonstrated, especially in the context of large-scale problem instances. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Long simple cycles
Long cycles
Complex networks
Integer linear programming
Graph algorithms
Local search
Hamiltonian cycles
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
A multi-task neural network for multilingual sentiment classification and language detection on Twitter用于Twitter多语言情感分类和语言检测的多任务神经网络
Locating the propagation source on complex networks with Propagation Centrality algorithm基于传播中心性算法的复杂网络传播源定位
Development of a Chromosomally Integrated Metabolite-Inducible Leu3p-α-IPM “Off-On” Gene Switch
PLoS ONE
IF0

