A Weighted Edge Clique Problem

Authors

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

Keywords:

Maximum weighted clique problem, an efficient algorithm, DIMACS graphs.

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

Downloads

Published

2013-06-03

How to Cite

Z. U. A. KHUHRO, K. MEMON, F. N. MEMON, & A. K. SOOMRO. (2013). A Weighted Edge Clique Problem. Sindh University Research Journal - SURJ (Science Series), 45(2). Retrieved from https://sujo.usindh.edu.pk/index.php/SURJ/article/view/5565

Issue

Vol. 45 No. 2 (2013): Sindh University Research Journal (Science Series) SURJ

Section

Articles