Parallel bioinspired algorithms for NP complete graph problems.
Israel Mark Martínez-PérezKarl-Heinz ZimmermannPublished in: J. Parallel Distributed Comput. (2009)
Keyphrases
- np complete
- polynomial time complexity
- computational complexity
- np complete problems
- optimization problems
- computationally complex
- depth first search
- satisfiability problem
- hard problems
- combinatorial optimization
- benchmark problems
- biologically inspired
- graph layout
- bounded treewidth
- parallel computers
- conjunctive queries
- partial solutions
- graph search
- data complexity
- graph theory
- maximum flow
- pspace complete
- search methods
- decision problems
- semi supervised
- learning algorithm