A weighted edge clique problem. | [Sindh University Research Journal • 2013]

Author(s):

1. Z. U. A. KHUHRO: Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan

2. K. MEMON: Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan

3. F. N. MEMON: Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan

4. 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.

Page(s): 393-398

DOI: DOI not available

Published: Journal: Sindh University Research Journal, Volume: 45, Issue: 2, Year: 2013

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views