Skip to main content
padlock icon - secure page this page is secure

A Biological Algorithm to Solve the Maximum Complete Subgraph Problem Based on Adleman-Lipton Model

Buy Article:

$106.34 + tax (Refund Policy)

The maximum complete subgraph problem is to find a biggest vertex independent set in a given undirected graph. It is a vitally important NP problem in graph theory and applied mathematics. In this paper, we present a new DNA algorithm to solve the problem with DNA molecular operations using O(n 2) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics


Document Type: Research Article

Publication date: November 1, 2014

More about this publication?
  • Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
  • Editorial Board
  • Information for Authors
  • Submit a Paper
  • Subscribe to this Title
  • Terms & Conditions
  • Ingenta Connect is not responsible for the content or availability of external websites
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more