IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/275019.html
   My bibliography  Save this article

Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model

Author

Listed:
  • Zhaocai Wang
  • Jiangfeng Qin
  • Zuwen Ji
  • Dongmei Huang
  • Lei Li

Abstract

The maximum weighted clique (MWC) problem, as a typical NP-complete problem, is difficult to be solved by the electronic computer algorithm. The aim of the problem is to seek a vertex clique with maximal weight sum in a given undirected graph. It is an extremely important problem in the field of optimal engineering scheme and control with numerous practical applications. From the point of view of practice, we give a parallel biological algorithm to solve the MWC problem. For the maximum weighted clique problem with edges and vertices, we use fixed length DNA strands to represent different vertices and edges, fully conduct biochemical reaction, and find the solution to the MVC problem in certain length range with time complexity, comparing to the exponential time level by previous computer algorithms. We expand the applied scope of parallel biological computation and reduce computational complexity of practical engineering problems. Meanwhile, we provide a meaningful reference for solving other complex problems.

Suggested Citation

  • Zhaocai Wang & Jiangfeng Qin & Zuwen Ji & Dongmei Huang & Lei Li, 2015. "Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-8, June.
    • Handle: RePEc:hin:jnlmpe:275019
    DOI: 10.1155/2015/275019
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/275019.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/275019.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/275019?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:275019. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.