No Detail Found!

A weighted edge clique problem.

Author(s)
Z. U. A. KHUHRO Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan
K. MEMON Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan
F. N. MEMON Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan
A. K. SOOMRO Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan
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.
Publication Details
Page(s) 393-398
DOI DOI not available
Published Journal: Sindh University Research Journal, Volume: 45, Issue: 2, Year: 2013

Request the full text from PASTIC

More from Sindh University Research Journal
0

Citations

0

Downloads

32

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk