A Polynomial Time Solution to the Clique Problem
Pawan Tamta, B.P. Pande, H.S. Dhami
TL;DR
This paper presents a polynomial time algorithm for the Clique Problem, leveraging a reduction to the Maximum Flow Network Interdiction Problem, and validates it with a C implementation.
Contribution
It introduces a novel polynomial time solution for the Clique Problem based on a reduction to maximum flow interdiction, challenging previous complexity assumptions.
Findings
Algorithm runs in polynomial time
C implementation validates the approach
Potential implications for complexity theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Security and Intrusion Detection · Infrastructure Resilience and Vulnerability Analysis · Information and Cyber Security