Data Structures and Algorithms


A P Time Solution to an NP Complete Problem

Authors: Q.P.Wimblik

Vertex Coloring can be reduced to a set of 2 color vertex coloring problems. This is achieved by utilizing an ability to account for every positive integer with a unique pair of smaller integers.

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2017-04-13 07:02:31

Unique-IP document downloads: 824 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus