An Incremental Genetic Algorithm for Graph Optimization Problems

[1]  Gerard J. M. Smit,et al.  An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits , 2010, 2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools.

[2]  Byung Ro Moon,et al.  A hybrid incremental genetic algorithm for subgraph isomorphism problem , 2014, GECCO.

[3]  Gregor von Laszewski,et al.  Intelligent Structural Operators for the k-way Graph Partitioning Problem , 1991, ICGA.

[4]  Byung Ro Moon,et al.  An efficient genetic algorithm for subgraph isomorphism , 2012, GECCO '12.

[5]  Byung Ro Moon,et al.  Solving Maximum Cut Problem with an Incremental Genetic Algorithm , 2016, GECCO.

[6]  Gerhard Reinelt,et al.  A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[7]  Zhipeng Lü,et al.  A tabu search based hybrid evolutionary algorithm for the max-cut problem , 2015, Appl. Soft Comput..

[8]  Pierre Chardaire,et al.  A PROBE-Based Heuristic for Graph Partitioning , 2007, IEEE Transactions on Computers.

[9]  Byung Ro Moon,et al.  A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[10]  Christopher Krügel,et al.  Polymorphic Worm Detection Using Structural Information of Executables , 2005, RAID.

[11]  Christian Borgelt,et al.  Mining molecular fragments: finding relevant substructures of molecules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[12]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[13]  Carlos Cruz,et al.  Optimization in dynamic environments: a survey on problems, methods and measures , 2011, Soft Comput..

[14]  Derya Birant,et al.  An incremental genetic algorithm for classification and sensitivity analysis of its parameters , 2011, Expert Syst. Appl..

[15]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[16]  Alice E. Smith,et al.  A Seeded Memetic Algorithm for Large Unit Commitment Problems , 2002, J. Heuristics.

[17]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[18]  Gerhard Reinelt,et al.  A benchmark library and a comparison of heuristic methods for the linear ordering problem , 2012, Comput. Optim. Appl..

[19]  Horst Bunke,et al.  Efficient Subgraph Isomorphism Detection: A Decomposition Approach , 2000, IEEE Trans. Knowl. Data Eng..

[20]  Kuo-Chi Lin,et al.  An incremental genetic algorithm approach to multiprocessor scheduling , 2004, IEEE Transactions on Parallel and Distributed Systems.

[21]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[22]  John Aycock,et al.  Computer Viruses and Malware , 2006, Advances in Information Security.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[25]  Yong-Hyuk Kim,et al.  Genetic approaches for graph partitioning: a survey , 2011, GECCO '11.

[26]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[27]  Carl Ebeling,et al.  SubGemini: Identifying SubCircuits using a Fast Subgraph Isomorphism Algorithm , 1993, 30th ACM/IEEE Design Automation Conference.

[28]  Yong-Hyuk Kim,et al.  Multi-attractor gene reordering for graph bisection , 2006, GECCO.

[29]  Gareth Jones,et al.  Matching two-dimensional chemical graphs using genetic algorithms , 1994, J. Chem. Inf. Comput. Sci..

[30]  Mario Vento,et al.  Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs , 2007, J. Graph Algorithms Appl..

[31]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[32]  Jianzhuang Liu,et al.  A Graph-Based Method for Face Identification from a Single 2D Line Drawing , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[33]  Robert I. McKay,et al.  VLR: A Memory-Based Optimization Heuristic , 2014, PPSN.

[34]  Chris Walshaw,et al.  A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning , 2004, J. Glob. Optim..

[35]  Byung Ro Moon,et al.  Measuring Source Code Similarity by Finding Similar Subgraph with an Incremental Genetic Algorithm , 2016, GECCO.

[36]  Hamid Amiri,et al.  Incremental Genetic Algorithm , 2006, Int. Arab J. Inf. Technol..

[37]  G. Dueck.  New optimization heuristics , 1993 .

[38]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[39]  Andrew V. Goldberg,et al.  An exact combinatorial algorithm for minimum graph bisection , 2014, Math. Program..

[40]  David Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[41]  Theodosios Pavlidis,et al.  A Shape Analysis Model with Applications to a Character Recognition System , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[42]  Bo Song,et al.  A hybridization between memetic algorithm and semidefinite relaxation for the max-cut problem , 2012, GECCO '12.

[43]  Jens Krinke,et al.  Identifying similar code with program dependence graphs , 2001, Proceedings Eighth Working Conference on Reverse Engineering.

[44]  Chanchal K. Roy,et al.  A Survey on Software Clone Detection Research , 2007 .

[45]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[46]  Byung Ro Moon,et al.  A genetic algorithm for linear ordering problem using an approximate fitness evaluation , 2014, GECCO.

[47]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[48]  Philip S. Yu,et al.  GPLAG: detection of software plagiarism by program dependence graph analysis , 2006, KDD '06.

[49]  Byung Ro Moon,et al.  New malware detection system using metric-based method and hybrid genetic algorithm , 2012, GECCO '12.

[50]  Yong-Hyuk Kim,et al.  Lock-Gain Based Graph Partitioning , 2004, J. Heuristics.

[51]  Inwook Hwang,et al.  Moving Clusters within a Memetic Algorithm for Graph Partitioning , 2015 .

[52]  Byung Ro Moon,et al.  Malware detection based on dependency graph using hybrid genetic algorithm , 2010, GECCO '10.

[53]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).