A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
This paper presents a parallel algorithm to solve the Clique Partitioning Problem, an NP-complete problem. Given a graph G = (V, E), a clique is a complete subgraph in G. The clique partitioning problem is to partition the vertices in G into a number of cliques such that each vertex appears in one a...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Published: |
2002
|
| Online Access: | http://hdl.handle.net/10725/3537 http://s3.amazonaws.com/academia.edu.documents/30978516/10.1.1.3.258.pdf?AWSAccessKeyId=AKIAJ56TQJRTWSMTNPEA&Expires=1470914575&Signature=bMI6N%2FJHnxDvhq%2F%2Fh9iThifeZRM%3D&response-content-disposition=inline%3B%20filename%3DA_parallel_neural_networks_algorithm_for.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|