Research of the minimum vertex-cover solutions on the tree and lattice structures

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We focus the solution space of a most fundamental problem - Minimum Vertex-Cover problem - in theoretical computer science. After some rigorous analysis, we provide the formation mechanism of minimum vertex-cover solutions on the tree and give the organization of these solutions on arbitrary lattice structure. By the results, we can easily calculate the solution numbers on these structures and have better understanding of the hardness of Minimum Vertex-Cover problem. The proposed study and algorithm can make a new way on detecting the essential difficulty of NP-complete problems and designing efficient algorithms on solving them.

Original languageEnglish
Title of host publicationMaterials Science, Computer and Information Technology
PublisherTrans Tech Publications Ltd
Pages4926-4929
Number of pages4
ISBN (Print)9783038351733
DOIs
StatePublished - 2014
Event4th International Conference on Materials Science and Information Technology, MSIT 2014 - Tianjin, China
Duration: 14 Jun 201415 Jun 2014

Publication series

NameAdvanced Materials Research
Volume989-994
ISSN (Print)1022-6680
ISSN (Electronic)1662-8985

Conference

Conference4th International Conference on Materials Science and Information Technology, MSIT 2014
Country/TerritoryChina
CityTianjin
Period14/06/1415/06/14

Keywords

  • Computational complexity
  • Minimum vertex-cover problem
  • Solution space organization

Fingerprint

Dive into the research topics of 'Research of the minimum vertex-cover solutions on the tree and lattice structures'. Together they form a unique fingerprint.

Cite this