A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time...
A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity
About this item
Full title
Author / Creator
Publisher
London: Sage Publications Ltd
Journal title
Language
English
Formats
Publication information
Publisher
London: Sage Publications Ltd
Subjects
More information
Scope and Contents
Contents
The vertex coloring problem is a well-known combinatorial problem that requires each vertex to be assigned a corresponding color so that the colors on adjacent vertices are different, and the total number of colors used is minimized. It is a famous NP-hard problem in graph theory. As of now, there is no effective algorithm to solve it. As a kind of...
Alternative Titles
Full title
A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2497161043
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2497161043
Other Identifiers
ISSN
1064-1246
E-ISSN
1875-8967
DOI
10.3233/JIFS-200025
