A Polynomial Time Solution to the Clique Problem

B.P. Pande; H.S. Dhami; Pawan Tamta

REVIEW

A Polynomial Time Solution to the Clique Problem

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1403.1178 v2 pith:UGMZUT34 submitted 2014-02-21 cs.DS math.OC

Pawan Tamta , B.P. Pande , H.S. Dhami This is my paper · ORCID

classification cs.DSmath.OC

keywords problemcliquealgorithmpolynomialreductiontimebeencomputer

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

The Clique Problem has a reduction to the Maximum Flow Network Interdiction Problem. We review the reduction to evolve a polynomial time algorithm for the Clique Problem. A computer program in C language has been written to validate the easiness of the algorithm.

Discussion (0). Continue with ORCID to comment.

Pith tools