A WEIGHTED EDGE CLIQUE PROBLEM

Z. U. A. KHUHRO, K. MEMON, F. N. MEMON, A. K. SOOMRO

Abstract


This paper is an improvement to one of the most recent and an efficient algorithm Cliq that finds a clique from an undirected graph. The suggested improvements are detection of a clique from a random undirected graph where an addition of weight to its edges is given. In addition to that, the method is compared with the well-known existing methods of weighted clique problems.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2016 Sindh University Research Journal - SURJ (Science Series)

 Copyright © University of Sindh, Jamshoro. 2017 All Rights Reserved.
Printing and Publication by: Sindh University Press.