A Polynomial Time Solution to the Clique Problem
From MaRDI portal
Publication:3798709
DOI10.48550/ARXIV.1403.1178arXiv1403.1178MaRDI QIDQ3798709
B. P. Pande, H. S. Dhami, Pawan Tamta
Publication date: 21 February 2014
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.
This page was built for publication: A Polynomial Time Solution to the Clique Problem
