Year: 2014
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Tamta, Pawan, Pande, B. P., Dhami, H. S.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1806347295