Genetic algorithmic approach to find the maximum weight independent set of a graph

DOI10.1007/BF02832348zbMath1146.68404OpenAlexW1983739378MaRDI QIDQ2471331

Yanyan Li

Publication date: 22 February 2008

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02832348

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

A hybrid iterated local search heuristic for the maximum weight independent set problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
• An algorithm for finding a maximum weighted independent set in an arbitrary graph
• Finding a Maximum Clique in an Arbitrary Graph
• On the Maximum Weight Clique Problem
• A global optimization approach for solving the maximum clique problem
• Finding a Maximum Independent Set
• A New Algorithm for Generating All the Maximal Independent Sets
• Genetic algorithm to solve the p-centre and p-radius problem on a network

This page was built for publication: Genetic algorithmic approach to find the maximum weight independent set of a graph