Finding a maximum independent set in a permutation graph
Information Processing Letters
On the chromatic number of graphs
Journal of Optimization Theory and Applications
Theoretical Computer Science
On-line scheduling of parallel jobs with runtime restrictions
Theoretical Computer Science
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique
Journal of Heuristics
The Challenges of Real-Time AI
Computer
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Artificial intelligence in the maximum clique finding problem applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
An efficient branch-and-bound algorithm for finding a maximum clique
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Comparing the best maximum clique finding algorithms, which are using heuristic vertex colouring
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Prediction of area and length complexity measures for binary decision diagrams
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The paper discusses where the artificial intelligence principles can be applied in the graph theory NP-hard problems' algorithms in order to make those quicker and better. The paper aim is to concentrate different ideas on making graph algorithms to be intelligent in one place instead of leaving a research process in this area to be still chaotic. The artificial intelligence for the graph algorithms can be divided into an internal one, where the intelligence is a part of an algorithm, and an external, where it is used in a form of a meta-algorithm providing an infrastructure and handling other algorithms (dedicated for solving this particular NP-hard problem). Another classification can be done by NP-hard problems algorithms' elements to which the intelligence can be applied. Those can be summarised in a form of the following list: upper and lower bounds, algorithms' internal elements and techniques, a meta-algorithm intelligence deciding which algorithm to run on a particular graph, and a testing intelligence. It is possible to conclude that using the internal and external artificial intelligences can both improve the NP-hard problems algorithms' performance and produce adaptive algorithms that can be successfully used in different environments.