Solving the Maximum Clique Problem Using PUBB

13 years 8 months ago

Download ipdps.cc.gatech.edu

Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a classical NP

Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuich

Real-time Traffic

Clique | Distributed And Parallel Computing | Heuristic Algorithms Varies | Heuristics | IPPS 1998 |

claim paper

» A study of ACO capabilities for solving the maximum clique problem

» Iterated kOpt Local Search for the Maximum Clique Problem

» Solving the maximum clique problem by kopt local search

» A New Approach for Solving the Maximum Clique Problem

» Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools

» Markov Random Fields with Efficient Approximations

» Dynamic Local Search for the Maximum Clique Problem

» Clique Relaxations in Social Network Analysis The Maximum kPlex Problem

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	IPPS
Authors	Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuichi Hirabayashi

Comments (0)

Sciweavers

Solving the Maximum Clique Problem Using PUBB

Clique | Distributed And Parallel Computing | Heuristic Algorithms Varies | Heuristics | IPPS 1998 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers