Searching minimal fractional graph factors by lattice based evolution

Authors:
Xiyu Liu;Yinghong Ma;Yangyang Zheng
Affiliations:
School of Management and Economics, Shandong Normal University, Jinan, Shandong, China;School of Management and Economics, Shandong Normal University, Jinan, Shandong, China;School of Management and Economics, Shandong Normal University, Jinan, Shandong, China
Venue:
WSEAS Transactions on Information Science and Applications
Year:
2009

Citing 8
Cited 0

Simplified existence theorems for (g,f)-factors

Discrete Applied Mathematics - Computational combinatiorics
Closure and factor-critical graphs

Discrete Mathematics
The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A closure concept in factor-critical graphs

Discrete Mathematics
Factor criticality and complete closure of graphs

Discrete Mathematics
A detecting peak's number technique for multimodal function optimization

WSEAS Transactions on Information Science and Applications
A Cooperative approach to particle swarm optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.04

Visualization

Abstract

Spanning subgraphs is necessary for the communication in networks. Apart from theoretical existence results, effective technique of searching graph factors is an important problem in graph theory, complex networks, and applications which is NP hard. In this paper, we first propose a lattice based evolution technique. Then we present an evolutionary searching paradigm for the minimum fractal graph factors. A simple Markov analysis of the proposed genetic algorithm is given together with some experiments on the effects of parameters to the performance of the algorithms.